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

Revision history of "2010 USAJMO Problems/Problem 1"

Diff selection: Mark the radio boxes 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.

(newest | oldest) View ( | older 50) (20 | 50 | 100 | 250 | 500)
  • (cur | prev) 00:32, 7 May 2010‎ Aopsvd (talk | contribs)‎ . . (3,040 bytes) (+3,040)‎ . . (Created page with '==Problem== A permutation of the set of positive integers <math>[n] = {1,2,\ldots,n}</math> is a sequence <math>(a_1,a_2,\ldots,a_n)</math> such that each element of <math>[n]</m…')
(newest | oldest) View ( | older 50) (20 | 50 | 100 | 250 | 500)
Retrieved from "https://artofproblemsolving.com/wiki/index.php/2010_USAJMO_Problems/Problem_1"