MathDB

3

Part of PEN L Problems

Problems(1)

L 3

Source:

5/25/2007
The Fibonacci sequence {Fn}\{F_{n}\} is defined by F1=1,  F2=1,  Fn+2=Fn+1+Fn.F_{1}=1, \; F_{2}=1, \; F_{n+2}=F_{n+1}+F_{n}. Show that Fmn−1−Fn−1mF_{mn-1}-F_{n-1}^{m} is divisible by Fn2F_{n}^{2} for all m≥1m \ge 1 and n>1n>1.
inductionLinear Recurrences