Proof by Induction Homework: Proving F_n|F_{kn}

  • Thread starter Thread starter hangainlover
  • Start date Start date
  • Tags Tags
    Induction Proof
hangainlover
Messages
77
Reaction score
0

Homework Statement


I have proved the first one and I am trying to do the second using the result from part 1)


Homework Equations



F_1=1, F_2=2, F_n=F_{n-1}+F_{n-2}

The Attempt at a Solution


base case: F_1|F_k sinceF_1=1

Assume it works for n, F_n|F_{kn}
show F_{n+1}|F_{kn+k}

Well, using the part 1)
F_{kn+k}=F_kF_{kn+1}+F_{k-1}F_{kn}

That's as far as i could go..
 

Attachments

  • cc.JPG
    cc.JPG
    10.2 KB · Views: 395
Physics news on Phys.org
I have uplloaded the problem statement in the attachment
sorry i forgot to mention that
 
Last edited:
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