olymmath

SMO 2009 Problem 3

    for k∈Nk\in\mathbb{N} , define AnA_n for n=1,2,...n=1,2,... by An+1=nAn+2(n+1)2kn+2,A1=1A_{n+1} = \frac{ nA_n+2(n+1)^{2k} }{n+2} , A_1=1 Prove AnA_n is integer for all n≥1n\geq 1 , and AnA_n is odd if and only if n≡n\equiv 1 or 2(mod 4)

    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/2009/p3 · Tag A1NWAP90QS · Edit this page on GitHub · Keys: j next, k previous