Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 2009-01-28 06:56:42

FP1Student
Guest

Induction. o_O

Hey, I'm a little stuck on my induction work. I've managed most of the summing series one, but I get really confused when I get to inequalities.

Okay, I need to prove by mathematical induction that:

What I have got so far is that:

Step 1

Let n=1. LHS is 2x1=2 and the RHS is 1, so it is true as 2>1

Step 2

If n=k, ie. 2+4+6+8+...+2k>k² is true then when n=k+1, it would be:

2+4+6+8+...+2k+2>k²+2k+2

But then how do you go from there?

And there are a few other questions that I am stuck on, but I'm going to try and look over them again.

Thank you in advance.

#2 2009-01-28 07:17:41

TheDude
Member
Registered: 2007-10-23
Posts: 361

Re: Induction. o_O

You didn't do the induction step correctly.  It should be:

2 + 4 + 6 + 8 + ... + 2k + (2k + 2) > (k + 1)^2 = k^2 + 2k + 1

You already know that 2 + 4 + 6 + ... + 2k > k^2, so subtract both sides from the inequality.  The proof is trivial from there.


Wrap it in bacon

Offline

#3 2009-01-28 07:20:32

mathsmypassion
Member
Registered: 2008-12-01
Posts: 33

Re: Induction. o_O

2+4+....+2k+(2k+2)>K² + (2k +2) = (k+1)² +1 >(k+1)² QED

Offline

#4 2009-01-28 07:27:43

FP1Student
Guest

Re: Induction. o_O

TheDude wrote:

You didn't do the induction step correctly.  It should be:

2 + 4 + 6 + 8 + ... + 2k + (2k + 2) > (k + 1)^2 = k^2 + 2k + 1

You already know that 2 + 4 + 6 + ... + 2k > k^2, so subtract both sides from the inequality.  The proof is trivial from there.

So eventually from that you end up with 1>0?

#5 2009-01-28 07:44:26

TheDude
Member
Registered: 2007-10-23
Posts: 361

Re: Induction. o_O

We know:

2 + 4 + 6 + ... + 2k > k^2

Add 2k + 2 to both sides:

2 + 4 + 6 + ... + 2k + (2k + 2) > k^2 + 2k + 2 > k^2 + 2k + 1 QED.


Wrap it in bacon

Offline

#6 2009-01-28 08:07:27

FP1Student
Guest

Re: Induction. o_O

Ah, I'm so silly. >_<

Hmm, this is another inequality one, please tell me if I'm along the right path. Thank you. ^_^

Prove by mathematical induction that

Step 1:

Let n=1, 1^2 = 1 on the LHS and then on the right hand side 1^3/3 = 1/3 which is true as 1>1/3

Step 2:

Assuming n=k is true, then it would become k² > k³/3

Then n=k+1 would be k²+(k+1)²>k³/3+(k+1)³/3
                             ⇒ 6k²+6k+3>2k³+3k²+3k+1

In fact, I'm getting lost. o_O Is that right so far? Do I continue simplifying and cancelling that out?

#7 2009-01-28 08:10:18

JaneFairfax
Member
Registered: 2007-02-23
Posts: 6,868

Re: Induction. o_O

FP1Student wrote:

Assuming n=k is true, then it would become k² > k³/3

No. It would become

Last edited by JaneFairfax (2009-01-28 08:13:43)

Offline

#8 2009-01-28 08:12:35

FP1Student
Guest

Re: Induction. o_O

Ah, I need to add in the numbers before. Okay then.

Did you mean k³/3 though for the right hand side?

#9 2009-01-28 08:14:31

JaneFairfax
Member
Registered: 2007-02-23
Posts: 6,868

Re: Induction. o_O

Yes, it’s a cube on the RHS. I’ve corrected it.

Offline

#10 2009-01-28 08:27:13

FP1Student
Guest

Re: Induction. o_O

I'm really stuck on this. >_< What I've just done is this:

When n=k

And so when n=k+1

And I'm sure that that is not what you're supposed to do.

I'm not even sure if I have grasped this induction concept yet. Please could someone explain?

#11 2009-01-28 08:56:41

JaneFairfax
Member
Registered: 2007-02-23
Posts: 6,868

Re: Induction. o_O

At times like this it helps to try and work backwards and see if it leads you somewhere. Do this as rough work.

Now you want to get the RHS into the form

which is

So far you only have

So comparing the two, it appears that you want to have

But this is true because

(since
is a natural number) and
and so
.

So now you can continue. smile

Offline

Board footer

Powered by FluxBB