![Introduction to Lévy processes](http://s1.studyres.com/store/data/006045813_1-6087c4ac6b45f045528fe7b5632dc9b0-300x300.png)
Sequences and limits
... |an | = |an − α + α − aN + aN | ≤ |an − α| + |α − aN | + |aN | ≤ K + 2. Therefore for all n ∈ N we have that |an | ≤ K +2. Thus (an )n∈N is bounded. This means that any unbounded sequence must be divergent. However it is possible to have a bounded sequence which is not convergent. For example we hav ...
... |an | = |an − α + α − aN + aN | ≤ |an − α| + |α − aN | + |aN | ≤ K + 2. Therefore for all n ∈ N we have that |an | ≤ K +2. Thus (an )n∈N is bounded. This means that any unbounded sequence must be divergent. However it is possible to have a bounded sequence which is not convergent. For example we hav ...
Boolean algebra
... Given a truth table for a Boolean function, construction of the product-of-sums representation is trivial: - for each row in which the function value is 0, form a product term involving all the variables, taking the variable if its value is 1 and the complement if the variable's value is 0 - take th ...
... Given a truth table for a Boolean function, construction of the product-of-sums representation is trivial: - for each row in which the function value is 0, form a product term involving all the variables, taking the variable if its value is 1 and the complement if the variable's value is 0 - take th ...