olymmath

Putnam 2020 A5

  • Session A

Let ana_n be the number of sets SS of positive integers for which ∑k∈SFk=n,\sum_{k \in S} F_k = n, where the Fibonacci sequence (Fk)k≥1(F_k)_{k \geq 1} satisfies Fk+2=Fk+1+FkF_{k+2} = F_{k+1} + F_k and begins F1=1,F2=1,F3=2,F4=3F_1 = 1, F_2 = 1, F_3 = 2, F_4 = 3. Find the largest integer nn such that an=2020a_n = 2020.

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator putnam/2020/a5 · Tag H2R2K2KJ7R · Edit this page on GitHub · Keys: j next, k previous