olymmath

HMMT 2020 U19

  • Guts
  • Answer

The Fibonacci numbers are defined by F0=0,F1=1F_{0}=0, F_{1}=1, and Fn=Fn−1+Fn−2F_{n}=F_{n-1}+F_{n-2} for n≥2n \geq 2. There exist unique positive integers n1,n2,n3,n4,n5,n6n_{1}, n_{2}, n_{3}, n_{4}, n_{5}, n_{6} such that

∑i1=0100∑i2=0100∑i3=0100∑i4=0100∑i5=0100Fi1+i2+i3+i4+i5=Fn1−5Fn2+10Fn3−10Fn4+5Fn5−Fn6\sum_{i_{1}=0}^{100} \sum_{i_{2}=0}^{100} \sum_{i_{3}=0}^{100} \sum_{i_{4}=0}^{100} \sum_{i_{5}=0}^{100} F_{i_{1}+i_{2}+i_{3}+i_{4}+i_{5}}=F_{n_{1}}-5 F_{n_{2}}+10 F_{n_{3}}-10 F_{n_{4}}+5 F_{n_{5}}-F_{n_{6}}

Find n1+n2+n3+n4+n5+n6n_{1}+n_{2}+n_{3}+n_{4}+n_{5}+n_{6}.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

1545

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

Similar problems

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

Locator hmmt/2020/u19 · Tag P6CW0CM38H · Edit this page on GitHub · Keys: j next, k previous