olymmath

CWMO 2013 Problem 5

    A nonempty set AA is called an nn -level-goodset if A⊆{1,2,3,…,n}A \subseteq \{1,2,3,\ldots,n\} and ∣A∣≤min⁡x∈Ax|A| \le \min_{x\in A} x (where ∣A∣|A| denotes the number of elements in AA and min⁡x∈Ax\min_{x\in A} x denotes the minimum of the elements in AA ). Let ana_n be the number of nn -level-good sets. Prove that for all positive integers nn we have an+2=an+1+an+1a_{n+2}=a_{n+1}+a_{n}+1 .

    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 cn-wmo/2013/p5 · Tag XHH8Y8A527 · Edit this page on GitHub · Keys: j next, k previous