Monday, 6 May 2013

Proof by Induction Question including Rational Numbers



I just recently covered 'rational numbers' in class and was assigned the following question to solve using induction for n, so that for all qQ \ {1}:



nk=0qk=qn+11q1



I am not entirely sure on where to start, since up to this point I've only done proofs by induction involving natural numbers only. I've thought about leaving the variable q as it is, and doing



n = 1
then assuming statement is true for n, solve for n + 1



where nN, but it leaves me with a dead end, since there are too many unknown variables involved.



I hope someone can help me with this question and explain to me what the best approach would be and why!
Thank you!!


Answer



Your attempt is right! You do not have to change the q; leave it as it is and do the standard induction regarding to n.



Therefore lets start with our basis case n=0:




0k=0qk=q0+11q11=1



Next consider the new values n=m and n=m+1 which corresponde to the two equations



mk=0qk=qm+11q1m+1k=0qk=qm+21q1



Here the first one is our assumption the second one our hypothesis. Howsoever lets split up the second sum as the following



m+1k=0qk=mk=0qk=assumption+qm+1



As we can see the remaining sum equals our assumption. Therefore we can replace it by the given fraction from above. This yields to



mk=0qk+qm+1=qm+11q1+qm+1=qm+11+qm+2qm+1q1=qm+21q1




And thus we have shown that from our assumption the hypothesis follows and therefore we are done.


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...