olymmath

ILL 1984 Problem 14

    Let cc be a positive integer. The sequence {fn}\{f_n\} is defined as follows: f1=1,f2=c,fn+1=2fn−fn−1+2(n≥2).f_1 = 1, f_2 = c, f_{n+1} = 2f_n - f_{n-1} + 2 (n \geq 2).

    Show that for each k∈Nk \in \mathbb N there exists r∈Nr \in \mathbb N such that fkfk+1=fr.f_kf_{k+1}= f_r.

    Dataset text AoPS wiki problems. 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 ill/1984/p14 · Tag 5N3MR36WVM · Edit this page on GitHub · Keys: j next, k previous