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...) |
|||
| Line 3: | Line 3: | ||
== Solution == | == Solution == | ||
| − | + | See Problem 23, Chapter 4, in ''102 Combinatorial Problems'' by Andreescu and Feng. | |
== Resources == | == Resources == | ||
Latest revision as of 20:07, 29 May 2020
Problem
Find all finite sequences 
such that for every 
, 
, 
equals the number of times appears in the sequence.
Solution
See Problem 23, Chapter 4, in 102 Combinatorial Problems by Andreescu and Feng.
