2. Consider the stochastic process {Xn|n ≥ 0}given by X0 = 1,
Xn+1 = I{Xn = 1}Un+1 + I{Xn 6= 1}Vn+1, n ≥ 0, where {(Un, Vn)|n ≥
1} is an i.i.d. sequence of random variables such that Un is
independent of Vn for each n ≥ 1 and U1−1 is Bernoulli(p) and V1−1
is Bernoulli(q) random variables. Show that {Xn|n ≥ 1} is a Markov
chain and find its transition matrix. Also find P{Xn = 2}.
Consider the statement, “For all natural numbers n,n, if nn is
prime, then nn is solitary.” You do not need to know what
solitary means for this problem, just that it is a
property that some numbers have and others do not.
Write the converse and the contrapositive of the statement,
saying which is which. Note: the original statement claims that an
implication is true for all n,n, and it is that implication that we
are taking the converse and...
a real sequence xn is defined inductively by
x1 =1 and xn+1 = sqrt(xn +6) for
every n belongs to N
a) prove by induction that xn is increasing and
xn <3 for every n belongs to N
b) deduce that xn converges and find its limit
. Suppose that the sequence (xn) satisfies
|xn –α| ≤ c |
xn-1- α|2 for all n.
Show by induction that c | xn- α| ≤ c |
x0 - α|2n , and give some condition
That is sufficient for the convergence
of (xn) to α.
Use part a) to estimate the number of iterations needed to
reach accuracy
|xn –α| < 10-12 in case c = 10 and
|x0 –α |= 0.09.
Consider n numbers x1, x2, . . . , xn laid out on a circle and
some value α. Consider the requirement that every number equals α
times the sum of its two neighbors. For example, if α were zero,
this would force all the numbers to be zero. (a) Show that, no
matter what α is, the system has a solution. (b) Show that if α = 1
2 , then the system has a nontrivial solution. (c) Show...