During AMC testing, the AoPS Wiki is in read-only mode. No edits can be made.

Difference between revisions of "2010 USAMO Problems/Problem 6"

Line 3: Line 3:
== Solution ==
== Solution ==
We will prove that the answer is 68 by proving that it is not possible to have 67.
To find this, assume only the two extremes, that is when the points have the same, with <math>n</math> <math>-n</math> and so on for 67 more times. After I erase all 68 positive or negative for each one, we got 68 points, because there is no way to get less Henceforth we can get at least 68, because quite intuitively, we can erase more if this is not set up this way.
== See Also ==
== See Also ==
{{USAMO newbox|year=2010|num-b=5|after=Last question}}
{{USAMO newbox|year=2010|num-b=5|after=Last question}}

Revision as of 07:56, 19 April 2012


A blackboard contains 68 pairs of nonzero integers. Suppose that for each positive integer $k$ at most one of the pairs $(k, k)$ and $(-k, -k)$ is written on the blackboard. A student erases some of the 136 integers, subject to the condition that no two erased integers may add to 0. The student then scores one point for each of the 68 pairs in which at least one integer is erased. Determine, with proof, the largest number $N$ of points that the student can guarantee to score regardless of which 68 pairs have been written on the board.


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

See Also

2010 USAMO (ProblemsResources)
Preceded by
Problem 5
Followed by
Last question
1 2 3 4 5 6
All USAMO Problems and Solutions
Invalid username
Login to AoPS