Problems(1)
Let F0,F1,… be the sequence of Fibonacci numbers, with F0=0,F1=1, and Fn=Fn−1+Fn−2 for n≥2. For m>2, let Rm be the remainder when the product ∏k=1Fm−1kk is divided by Fm. Prove that Rm is also a Fibonacci number. PutnamPutnam 2021