View Full Version : Induction problem validation.
nascentmind
Dec31-10, 04:38 AM
1. The problem statement, all variables and given/known data
Using induction I need to prove (1+ny) \leq (y+1)n
2. Relevant equations
------
3. 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.
Filip Larsen
Dec31-10, 05:41 AM
You are not wrong, but you can only prove the last step assuming something about the value of y.
nascentmind
Dec31-10, 06:33 AM
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.
Filip Larsen
Dec31-10, 07:13 AM
Let me rephrase: can you prove your inequality if, say, y = -2?
nascentmind
Dec31-10, 07:38 AM
Yes I can. -3 < 1 for k = 1.
Filip Larsen
Dec31-10, 07:47 AM
That only proves the base case. Can you prove it for all n > 0?
nascentmind
Dec31-10, 07:56 AM
You mean for all y>0 instead of n>0?
Filip Larsen
Dec31-10, 09:19 AM
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).
nascentmind
Jan7-11, 10:35 AM
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
vBulletin® v3.8.7, Copyright ©2000-2012, vBulletin Solutions, Inc.