Proving Induction: 2x >(x+1)2 | Help with Discrete Math Homework

  • Thread starter Thread starter Gear2d
  • Start date Start date
  • Tags Tags
    Induction Proof
Click For Summary

Homework Help Overview

The discussion revolves around a proof by induction related to discrete mathematics, specifically examining the inequality 2x > (x + 1)². Participants are trying to understand the steps involved in proving that if the inequality holds for a certain value of k, it must also hold for k + 1.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning, Problem interpretation, Assumption checking

Approaches and Questions Raised

  • Participants are attempting to clarify the inductive steps and the application of the inductive hypothesis. Questions arise regarding the transition from 2k to 2(k + 1)² and the handling of terms in the proof. There is also confusion about the notation and whether the variable r was intended to be x.

Discussion Status

The discussion is active, with participants providing insights into the structure of induction proofs and addressing specific algebraic manipulations. Some guidance has been offered regarding the inductive hypothesis and the interpretation of terms, although there is no explicit consensus on the resolution of all questions raised.

Contextual Notes

There is a noted assumption that the proof is to be conducted for values of n greater than 5, which may influence the validity of certain steps in the proof. Participants are also navigating potential misunderstandings regarding variable usage and the implications of the inductive hypothesis.

Gear2d
Messages
49
Reaction score
0

Homework Statement



I was reading my discrete math book and have this example of how they prove by induction that if 2x >(x+1)2 that 2k+1 >[(k + 1) + 1]2
Where r>5

The Attempt at a Solution



2k+1 = 2 * 2k

>2(k+1)2 by inductive hypothesis => How? And what happened the +1 in [(k + 1) + 1]2 Also shouldn't it be (k+2)2 if you but in k + 1 for x, so how is it 2(k+1)2

= 2k2 + 4k + 2

= k2 + 4k + 4 + (k2 - 2) => How?

= (k+2)2 + (k2 - 2)

>(k+2)2 => why do you ignore the (k2 - 2)?
 
Last edited:
Physics news on Phys.org
For an induction proof there are three parts:
  1. It has to be true for some starting point, typically for k = 0 or k = 1.
  2. You assume that the statement is true for n = k.
  3. Show that if the statement is true for n = k, it must also be true for n = k + 1.

The problem you're looking at is slightly different in the numbering for my steps 2 and 3. They are assuming that the statement is true for n = k + 1 (the induction hypothesis -- a hypothesis is something that you assume is true), and then showing that it is also true for n = k + 2.

One other thing, you have r > 5. Did you mean k?
 
Sorry the r >5 was meant to be x >5 in 2x >(x+1)2
 
Gear2d said:

Homework Statement



I was reading my discrete math book and have this example of how they prove by induction that if 2x >(x+1)2 that 2k+1 >[(k + 1) + 1]2
Where r>5
No, that makes no sense. No formula in "x" will tell you anything about a different formula in "k". And there is no "r" in it! I suspect you mean that you are asked to prove that 2n> (n+1)2 for all n> 5. And one step in doing that will be to show that "if 2k> (k+1)2, then 2k+1> ((k+1)+1)2, the "induction hypothesis".


The Attempt at a Solution



2k+1 = 2 * 2k

>2(k+1)2 by inductive hypothesis => How?

The inductive hypothesis is that 2k> (k+1)2. To show that is true for the "next" k, you look at 2k+1= 2*2k. Since (the inductive hypothesis) 2k> (k+1)2, 2*2k> 2*(k+1)2. Putting those together, 2k+1> 2(k+1)2.

And what happened the +1 in [(k + 1) + 1]2
They aren't there yet! They are starting from the left and showing that it gives the other side.

Also shouldn't it be (k+2)2 if you but in k + 1 for x, so how is it 2(k+1)2

= 2k2 + 4k + 2

= k2 + 4k + 4 + (k2 - 2) => How?
Surely you know enough algebra to do that yourself.
2k2+ 4k+ 2= k2+ k2+ 4k + 2= (k2+ 4k+ 2)+ k2 (I've just moved on "k2" to the end)

Now, you should know that (k+ 1+ 1)2= (k+2)2= k2+ 4k+ 4. What we already have, k2+ 4k+ 2 needs to have 2 added to it to get that. Of course, in order to keep this true we also have to subtract 2:
k2+ 4k+ 2+ 2+ k2-2


= (k+2)2 + (k2 - 2)

>(k+2)2 => why do you ignore the (k2 - 2)?
Because it is larger than 0! We aren't showing "= " we are showing ">". Since k> 5 (remember that) k2- 2 is larger than 0 (in fact it is at least 23!). Adding a positive number to any number makes it larger.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
4
Views
1K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 23 ·
Replies
23
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
7
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K