Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2001 IMO Shortlist Problems/C5

Revision as of 17:32, 20 August 2008 by Minsoens (talk | contribs) (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...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

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.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

Resources

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2001_IMO_Shortlist_Problems/C5&oldid=27505"