S.O.S. Mathematics CyberBoard

Hi all..

I'm trying to prove the following...

3^n > 3n + 1 for all positive integers n > 1... (*)

I'm using induction on n to prove the above..

Basis Step:

n = 2: 3^2 = 9 > 3(2) + 1 = 7

Inductive Step:

Assume (*) is true for some value of n > 1 (Inductive Hypothesis)

Need to show it is also true for n + 1

That is need to show:

3^(n+1) > 3(n+1) + 1

3^(n+1) > 3n + 4

Now

3^(n+1) =

3 * 3^n > 3 * (3n+1) (By I.H.) = 9n + 3

My question is, do I just say that 9n + 3 > 3n + 4 at this point and conclude that (*) is true? Or is there some other justification I need to show.

Thank you

_________________
Mathematics is one of the essential emanations of the human spirit, a thing to be valued in and for itself, like art or poetry. -- Oswald Veblen, 1924.

NO! Almost, but not quite. What you need to show is that, for that , this will complete your proof.

_________________
(\ /)
(O.o)
(> <)
This is Bunny. Copy Bunny into your signature to help him on his way to world domination

Thanks..

You mean for n > 1

and I meant 3 * 3^n > 3 * (3n+1) (By I.H.)

_________________
Mathematics is one of the essential emanations of the human spirit, a thing to be valued in and for itself, like art or poetry. -- Oswald Veblen, 1924.

It doesn't matter for the second part, but yes, if you show it for n>0, then in particular it's true for n>1. And you are correct with your application of the I.H. if that is where you intended it.

_________________
(\ /)
(O.o)
(> <)
This is Bunny. Copy Bunny into your signature to help him on his way to world domination