MathDB
IMO ShortList 2001, combinatorics problem 5

Source: IMO ShortList 2001, combinatorics problem 5

September 30, 2004
combinatoricscountingInteger sequenceIMO Shortlist

Problem Statement

Find all finite sequences (x0,x1,…,xn)(x_0, x_1, \ldots,x_n) such that for every jj, 0≤j≤n0 \leq j \leq n, xjx_j equals the number of times jj appears in the sequence.
Back to ProblemsView on AoPS