(a) For n=2, b2 =
=>
For n =3,
=>
=>
For n=4.,
=>
=>
For n = 5,
=>
=>
=>
b2 = 2, b3 = 9/2, b4 = 8, b5 = 25/2
(b) Looking at the pattern,
b(2n) = 2n2, b(2n+1) = (2n+1)2/2
(c) For n = 0, b0 = 0 , b1 = 1/2
Suppose the result is true for all values less than n
For n+1, b2(n+1) = b2n+2 =
=>
=>
=>
=>
=>
=>
=>
Similarly b2n = 2n2
Hence our guess is true
3. The sequence bois defined as follows: boo, and for integers n 2 2, bn V1...
Discrete Mathematics 3. The sequence bo, bi, b2, is defined as follows: bo 0, bnd for integers n 22, bn- ehne (a) Calculate b2, b3, ba and bs (b) Use part (a) to guess a formula for bn for all integers n 20. c) Prove by induction on n that your guess in part (b) is correct.
(8 marks) Suppose that bo, bi,b2,... is a sequence defined as follows: bo 1, b 2, b2 3, and b bk-1 + 4bk-2 +5bk-3 for all integers k 2 3. Prove by mathematical induction that bn S 3" for all integers n 2 0.
: Let a1, a2, a3, . . . be the sequence of integers defined by a1 = 1 and defined for n ≥ 2 by the recurrence relation an = 3an−1 + 1. Using the Principle of Mathematical Induction, prove for all integers n ≥ 1 that an = (3 n − 1) /2 .
PROVE BY INDUCTION Prove the following statements: (a) If bn is recursively defined by bn = bn-1 + 3 for all integers n > 1 and bo = 2, then bn = 3n + 2 for all n > 0. (b) If an is recursively defined by cn = 3Cn-1 + 1 for all integers n > 1 and Co = 0, then cn = (3” – 1)/2 for all n > 0. (c) If dn is recursively defined by...
Given the sequence an defined recursively as follows: an 3an-1+2 for n 2 1 Al Terms of a Sequence (5 marks) Calculate ai , аг, аз, а4, а5 Keep your intermediate answers as you will need them in the next question. A2 Iteration (5 marks) Using iteration, solve the recurrence relation when n21 (i.e. find an analytic formula for an). Simplify your answer as much as possible, showing your work and quoting any formula or rule that you use. In...
(14) Given a sequence of integers {fi,f2 /. defined by the following recursive function f (n)-., n e N such that s(2) 5, Evamine the sruture of this sequence and then compute J, in closed-form.Prove by using strong induction as discussed in class that your function f, is indeed correct.
Let ao 2 bo > 0, and consider the sequences an and bn defined by an + bn n20 (1) Compute an+l-bn+1 1n terms of Van-v/bn. (2) Prove that the sequence an is nonincreasing, that the sequence bn Is nonde- creasing, and that an 2 bn for all n 20 (3) Prove that VanVbn S Cr for all n20, where C> 0 and y>1 (give values of C and γ for which this inequality holds). Conclude that an-bn C,γ-n, where...
The Fibonacci numbers are defined as follows, f1=1, f2=1 and fn+2=fn+fn+1 whenever n>= 1. (a) Characterize the set of integers n for which fn is even and prove your answer using induction (b) Please do b as well. The Fibonacci numbers are defined as follows: fi -1, f21, and fn+2 nfn+1 whenever n 21. (a) Characterize the set of integers n for which fn is even and prove your answer using induction. (b) Use induction to prove that Σ. 1...
Consider the sequence defined by o = 0 and 2 = 2 +(-1)"' i l for n EN Find an expression for in standard form, then prove that your formula is correct for all integers n > 0.
Suppose that 20, 21, 22, ... is sequence defined as follows. do = 5,21 = 16,0 integers n > 2. Prove that an = 3.2" +2.5" for all integers n > 0. = 7an-1 – 10an-2 for all