olymmath

ELMO 2010 Problem 2

    Let rr and ss be positive integers. Define a0=0a_0 = 0 , a1=1a_1 = 1 , and an=ran−1+san−2a_n = ra_{n-1} + sa_{n-2} for n≥2n \geq 2 . Let fn=a1a2⋯anf_n = a_1a_2\cdots a_n . Prove that fnfkfn−k\frac{f_n}{f_kf_{n-k}} is an integer for all integers nn and kk such that 0<k<n0 < k < n .

    Evan O' Dorney.

    Dataset text AI-MO AoPS. Quoted with source.

    Official text: ELMO 2010 official paper, page 1.

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