This problem certainly does not "need" induction to prove b/c the terms are monotonically increasing and they start with  so all  ... but here is the inductive proof:



Base case:

  6 > 5, so the base case is true



Hypothesis:

 for n=k



we also can write

  (*)



Step case:

Let n=k+1.  We must show  for n=k+1 (then it holds for all k>=1)





Substitute by using (*):





Now,   > 5 by the hypothesis  (and  3(k+1) > 0  since k>0) 

so the RHS is greater than 5 and  for n=k+1.



Therefore  for  ■





In my opinion, much better introductory problems exist for teaching proof by induction.





  

RELATED QUESTIONS

The sequence {an} is defined recursively as follows: a1 = 6 and an+1 = 3. Find an... (answered by ikleyn)

Prove by induction that for all positive integers value of n:
{{{5^(2n)+3n-1}}} is an... (answered by Edwin McCravy)

The sequence an is defined recursively by the rules a0 = 0, a1 = 3, and for n is greater... (answered by davethejackal)

Let {an}∞n=1 be a sequence whose partial sums are {Sn}∞n=1. Suppose that a1=2  (answered by greenestamps)

The following are defined using recursion formulas. Write the first four terms of each... (answered by greenestamps)

Find the first 40 terms of the sequence defined by A(n+1) = {(1/2)An if An is an odd... (answered by Edwin McCravy)

  Write the equation of the arithmetic sequence defined by a1 = 3 and a4 = 0. (write your  (answered by stanbon)

The sequence is defined recursively. Write the first four terms.... (answered by Fombitz)

the sequence shown below is defined using a recursion formula. write the first four terms  (answered by amarjeeth123)