# Another Induction

• Sep 6th 2006, 11:39 AM
a4swe
Another Induction
Got another problem on induction, this time I don't even know who to start and what to do.

What I want to do is to show that $3^n \geq n^3$ is true for all
$n \in$ N.
Here we define the natural set of numbers decluding 0.

From here I don't know much about what to do but show it true for n=1, witch I of course have done.
Anyone got any ideas?
• Sep 6th 2006, 12:21 PM
ThePerfectHacker
Quote:

Originally Posted by a4swe
Got another problem on induction, this time I don't even know who to start and what to do.

What I want to do is to show that $3^n \geq n^3$ is true for all
$n \in$ N.
Here we define the natural set of numbers decluding 0.

From here I don't know much about what to do but show it true for n=1, witch I of course have done.
Anyone got any ideas?

---
We note that,
$3^0\geq 0^3$
$3^1\geq 1^3$
Let S represent all N such that it is true.
We know that $0,1\in \mathbb{N}$.

Assume, $k\in S$, i.e. that it is true for k.
Then,
$3^k\geq k^3$
Multiply by 3,
$3^{k+1}\geq 3k^3$

Note that,
$2k^3\geq 3k^2+3k+1$
For $k\geq 2$
Add $k^3$ to both sides,
$3k^3\geq k^3+3k^2+3k+1$
Gaze upon ye perfect cubical,
$3k^3\geq (k+1)^3$
Transitivity,
$3^{k+1}\geq (k+1)^3$
Thus,
$(k+1)\in S$

Thus, S contain all N, i.e. true for all integers.
• Sep 6th 2006, 12:44 PM
a4swe
Quote:

Excuse me, the others forums I am active on keep a high "one topic only" policy, witch means that all subjects about let's say induction goes under one topic. That was not the case here I have to and will check the rules and posting guide lines.
Once again, I am sorry.

Quote:

We know that $0,1\in \mathbb{N}$.
Well, that wasn't true for the definition of N I used, but ok it doesn't interfere with the soulution in general, I just don't care for the 0. :)
Thanks for the soultion, I will now go back to my pencils and papers.
Good night to you!
• Sep 6th 2006, 12:47 PM
ThePerfectHacker
Quote:

Originally Posted by a4swe
Excuse me, the others forums I am active on keep a high "one topic only" policy

Maybe it was okay to do that, I am just a moderator I like to boss people around, it makes me feel as a superior being (which of course I am).
• Sep 6th 2006, 10:18 PM
CaptainBlack
Quote:

Originally Posted by a4swe
Excuse me, the others forums I am active on keep a high "one topic only" policy, witch means that all subjects about let's say induction goes under one topic. That was not the case here I have to and will check the rules and posting guide lines.
Once again, I am sorry.

Frankly I don't care what other site's policies are. Posting a new
quickly nobody can tell which question any new replies apply to.

If I find it happening I will split the thread, and if people persist
after having this explained to them they will be given negetive
reputation feedback.

RonL
• Sep 7th 2006, 07:59 AM
a4swe
Quote:

Frankly I don't care what other site's policies are.
Off course you don't, I just wanted to explain (not to make excuses) my wrongfull actions, it won't happen again.
• Sep 7th 2006, 02:14 PM
a4swe
More on topic then:

Quote:

Note that,
$
2k^3\geq 3k^2+3k+1
$

For
Yes, I have noted that and yes it's true.
But how do I show it?
• Sep 7th 2006, 03:04 PM
topsquark
Quote:

Originally Posted by a4swe
More on topic then:

Yes, I have noted that and yes it's true.
But how do I show it?

You may find it easier to show
$3k^3 \ge (k + 1)^3$

or equivalently

$3 \ge \frac{(k+1)^3}{k^3}$

This is easily done by considering different values of k and noting that $\frac{(k+1)^3}{k^3}$ monotonically decreases to a value of 1 as k increases indefinitely.

-Dan
• Sep 7th 2006, 03:10 PM
a4swe
A lot easier, thanks.
Off to bed now.
• Sep 7th 2006, 04:18 PM
ThePerfectHacker
Quote:

Originally Posted by a4swe
Yes, I have noted that and yes it's true.
But how do I show it?

Use another induction argument :D
• Sep 7th 2006, 08:52 PM
a4swe
Quote:

Use another induction argument
Was afraid so. :)
Ok, we try that.