olymmath

KURSCHAK 2002 Problem 2

    The Fibonacci sequence is defined as f1=f2=1f_1=f_2=1 , fn+2=fn+1+fnf_{n+2}=f_{n+1}+f_n ( n∈Nn\in\mathbb{N} ). Suppose that aa and bb are positive integers such that ab\frac ab lies between the two fractions fnfn−1\frac{f_n}{f_{n-1}} and fn+1fn\frac{f_{n+1}}{f_{n}} . Show that b≥fn+1b\ge f_{n+1} .

    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 kurschak/2002/p2 · Tag SHXHSB0FRJ · Edit this page on GitHub · Keys: j next, k previous