olymmath

Putnam 2021 B4

  • Session B

Let F0,F1,…F_0, F_1, \dots be the sequence of Fibonacci numbers, with F0=0F_0 = 0, F1=1F_1 = 1, and Fn=Fn−1+Fn−2F_n = F_{n-1} + F_{n-2} for n≥2n \geq 2. For m>2m > 2, let RmR_m be the remainder when the product ∏k=1Fm−1kk\prod_{k=1}^{F_m-1} k^k is divided by FmF_m. Prove that RmR_m is also a Fibonacci number.

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by Manjul Bhargava, Kiran Kedlaya and Lenny Ng

The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).

Similar problems

These problems have the most words in common with this statement.

Locator putnam/2021/b4 · Tag FFZJV1A9ZE · Edit this page on GitHub · Keys: j next, k previous