Is My Induction Proof for (1+ny) ≤ (y+1)n Correct?

  • Thread starter Thread starter nascentmind
  • Start date Start date
  • Tags Tags
    Induction
AI Thread Summary
The discussion centers on proving the inequality (1+ny) ≤ (y+1)n using mathematical induction. The base case for n=1 holds true, but the challenge arises in the induction step for k+1. It is noted that the proof requires careful consideration of the value of y, specifically that the inequality can only be proven for y > 0. The conversation highlights the necessity of analyzing cases for y, particularly when y is negative, as the original inequality may not hold. Ultimately, the proof's validity hinges on the assumption that y is a positive real number.
nascentmind
Messages
52
Reaction score
0

Homework Statement



Using induction I need to prove (1+ny) \leq (y+1)n


Homework Equations



------

The Attempt at a Solution



For n = 1. 1+y = y+1.

For some n = k
(1+ky) \leq (y+1)k

Now to prove for k+1
(1+ky+y)\leq (y+1)k+y
Now I have to prove that (y+1)k+y \leq (y+1)k+1

By simply expanding (y+1)k (y+1) can we can see it is greater?

Am I right to this point in solving the problem? If not please provide just a hint.
 
Last edited:
Physics news on Phys.org
You are not wrong, but you can only prove the last step assuming something about the value of y.
 
The real question is actually (1+x)1/n - 1 \leq x/n .

I have substituted x/n = y. That was the hint given in the book. Here x is a real number and n is an integer.
So now y would be a real number.
 
Let me rephrase: can you prove your inequality if, say, y = -2?
 
Yes I can. -3 < 1 for k = 1.
 
That only proves the base case. Can you prove it for all n > 0?
 
You mean for all y>0 instead of n>0?
 
I mean n > 0.

Perhaps my questions are more confusing than helpful, so let me be more direct. In your induction step you want to show that

(1) (1+ky)+y \leq (1+y)^k + y(1+y)^k

given the premises that 1+ky \leq (1+y)^k. This means that if you can prove

(2) y \leq y(1+y)^k

then you can prove (1), since a \leq b and c \leq d implies a+c\leq b+d. To prove (2) you have two cases, y > 0 and y < 0. The later result in (1+y)^k \leq 1 which is clearly false for some values of y and k, so that means you can only prove your original inequality by induction when y > 0, and you therefore have to make additional analysis to prove or disprove if your original inequality holds for y < 0.


(I'm off for new year preparations and won't follow this discussion for a while).
 
Re-read the problem and it mentions x is a positive real number and n is a positive integer.
Hence y = x/n > 0
Correct me if I am wrong
Now to prove
y \leq y(1+y)k

If y > 0 is true then y + 1 > 1. (Adding 1 to both sides)
Hence (y+1)k > 1
Multiplying y on both the sides we have y (y+1)k > y
 
Back
Top