Solution Found!
A sequence {an} is defined recursively by a1 = 2, a2 = 6 and an = 2an1an2 +2 for n
Chapter 4, Problem 21(choose chapter or problem)
QUESTION:
A sequence {an} is defined recursively by a1 = 2, a2 = 6 and an = 2an1an2 +2 for n 3.Prove that an = n(n + 1) for every positive integer n.
Questions & Answers
QUESTION:
A sequence {an} is defined recursively by a1 = 2, a2 = 6 and an = 2an1an2 +2 for n 3.Prove that an = n(n + 1) for every positive integer n.
ANSWER:Step 1 of 3
The statement given in the question can be proved true using the mathematical induction. Using mathematical induction, the statement is assumed to be true for the value and then proved to be true for .