Art of Problem Solving
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

1999 BMO Problems/Problem 4: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

28 December 2007

  • curprev 13:5913:59, 28 December 2007 Boy Soprano II talk contribs 1,963 bytes +1,963 New page: == Problem == Let <math>\{a_n \}_{n\ge 0}</math> be a non-decreasing, unbounded sequence of non-negative integers with <math>a_0=0</math>. Let the number of members of the sequence not e...
Retrieved from "https://wiki.aopstest.com/wiki/index.php?title=1999_BMO_Problems/Problem_4"