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

2010 USAMO Problems/Problem 6: 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.

15 January 2022

4 July 2013

19 April 2012

29 March 2012

28 March 2012

6 June 2011

  • curprev 13:1013:10, 6 June 2011 Minsoens talk contribs 702 bytes +702 Created page with "== Problem == A blackboard contains 68 pairs of nonzero integers. Suppose that for each positive integer <math>k</math> at most one of the pairs <math>(k, k)</math> and <math>(-..."
Retrieved from "https://wiki.aopstest.com/wiki/index.php?title=2010_USAMO_Problems/Problem_6"