Logic - Proof by Induction - Need help

amirsad

New member
Joined
Aug 7, 2015
Messages
1
Hi can someone help me answer this question I'm stuck on.

(b) A sequence of integers x1, x2, ..., xk,..., is defined recursively as follows: x1 = 2 and xk+1 = 7xk for k > 1.

(i) Calculate x2, x3, and x4.
(ii) Deduce a formula for the n-th term -- that is, xn in terms of n -- and then prove its validity, using the principle of mathematical induction.


Also can you show me how you do it. Thanks
 
Last edited by a moderator:
(b) A sequence of integers x1, x2, ..., xk,..., is defined recursively as follows: x1 = 2 and xk+1 = 7xk for k > 1.

(i) Calculate x2, x3, and x4.
(ii) Deduce a formula for the n-th term -- that is, xn in terms of n -- and then prove its validity, using the principle of mathematical induction.


Also can you show me how you do it. Thanks
I've typed out the exercise for you. Now you can do part (i), which is a simple matter of multiplication.

For part (ii), first study this lesson on how to do induction proofs. Once you have completed that lesson (including working through all of the examples for yourself), please attempt part (ii). If you get stuck, you can then reply with a clear listing of your efforts so far. Thank you! ;)
 
Last edited by a moderator:
Top