olymmath

SILK-ROAD 2019 Problem 4

    The sequence {an}\{a_n \} is defined as follows: a0=1a_0 = 1 and an=∑k=1[n]an−k2{a_n} = \sum \limits_ {k = 1} ^ {[\sqrt n]} {{a_ {n - {k ^ 2 }}}} for n≥1.n \ge 1. Prove that among a1,a2,…,a106a_1, a_2, \ldots, a_ {10 ^ 6} there are at least 500500 even numbers. (Here, [x][x] is the largest integer not exceeding xx .)

    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 silk-road/2019/p4 · Tag KAPJNFDHTP · Edit this page on GitHub · Keys: j next, k previous