olymmath

SMO 2015 Problem 4

    Let f0,f1,...f_0, f_1,... be the Fibonacci sequence: f0=f1=1,fn=fn−1+fn−2f_0 = f_1 = 1, f_n = f_{n-1} + f_{n-2} if n≥2n \geq 2 . Determine all possible positive integers nn so that there is a positive integer aa such that fn≤a≤fn+1f_n \leq a \leq f_{n+1} and that a(1f1+1f1f2+⋯+1f1f2...fn)a( \frac{1}{f_1}+\frac{1}{f_1f_2}+\cdots+\frac{1}{f_1f_2...f_n} ) is an integer.

    Dataset text AI-MO AoPS. 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

    Similar problems

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

    Locator sg-smo/2015/p4 · Tag Q35GGHW413 · Edit this page on GitHub · Keys: j next, k previous