olymmath

ISL 2001 C5

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.

Attachments:

logo01.gif

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 isl/2001/c5 · Tag 88NDJAVC0Y · Edit this page on GitHub · Keys: j next, k previous