olymmath

BALKAN-SL 2014 A6

    A6\boxed{A6} The sequence a0,a1,...a_0,a_1,... is defined by the initial conditions a0=1,a1=6a_0=1,a_1=6 and the recursion an+1=4an−an−1+2a_{n+1}=4a_n-a_{n-1}+2 for n>1.n>1. Prove that a2k−1a_{2^k-1} has at least three prime factors for every positive integer k>3.k>3.

    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 balkan-sl/2014/a6 · Tag S1DY3N8W1B · Edit this page on GitHub · Keys: j next, k previous