Difference between revisions of "2001 IMO Shortlist Problems/C5"
m (New page: == Problem == Find all finite sequences <math>(x_0, x_1, \ldots,x_n)</math> such that for every <math>j</math>, <math>0 \leq j \leq n</math>, <math>x_j</math> equals the number of times <m...) |
(No difference)
|
Revision as of 18:32, 20 August 2008
Problem
Find all finite sequences 
such that for every 
, 
, 
equals the number of times appears in the sequence.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
