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) 10:31, 28 May 2010Yugrey (talk | contribs). . (5,575 bytes) (+2,527). . (Well, it's the same but it looks different. I think writing the same thing in many ways looks better and is more understandable; the reader can choose which one he or she likes best.)
  • (cur | prev) 00:34, 7 May 2010Aopsvd (talk | contribs). . (3,048 bytes) (+8). . (Proof)
  • (cur | prev) 00:32, 7 May 2010Aopsvd (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)