Mathematical Induction using a strong hypothesis

mamma_mia66
Messages
51
Reaction score
0

Homework Statement


If a0=1, and a1=2, and

an=(a(n-1))^2/an-2 for n>=2,
prove by induction that an=2^n for n>=0



Homework Equations





The Attempt at a Solution


(B) a0=1=2^0=1 yes is true
a1=2=2^1=2 yes is true

(I) ak=(2k-1)^2/2k-2=2k

Is it true that what I solved. It seems very easy.

I started first with a(k+1)=(a(k+1-1))^2/a(k+1-2)=
(2k)^2(k-1)=2(k+1)
Please someone help if I am doing something wrong. I will appreciate. Thank you.
 
Physics news on Phys.org
It seems that you have the right idea, but I do not know what is different between (I) and your solution for ak+1. Where precisely is your inductive hypothesis?
 
It IS very easy. So your induction step is: if a_{k-1}=2^(k-1) and a_{k-2}=2^(k-2) then a_k=2^(k) (by doing the algebra you doubtless did). It looks fine to me.
 
That is where I am confused. I know that I need to fallow the form an=2^n

Then I don't need to do a(k+1)...

I did so many problems in my HW and now I don't get it what I am doing:smile:
 
Thank you guys.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top