IMO Shortlist 2001 problem C5


Kvaliteta:
  Avg: 0,0
Težina:
  Avg: 8,0
Dodao/la: arhiva
2. travnja 2012.
LaTeX PDF
Find all finite sequences (x_0, x_1, \ldots,x_n) such that for every j, 0 \leq j \leq n, x_j equals the number of times j appears in the sequence.
Izvor: Međunarodna matematička olimpijada, shortlist 2001