2010 USAMO Problems/Problem 6

Revision as of 15:34, 28 March 2012 by Va2010 (talk | contribs)

Problem

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.

Solution

To find this, assume only the two extremes, that is when the points have the same, with $nsub1$ $-nsub1$ and so on for 66 more times and then two zeroes. After I erase all 67 positive or negative for each one, I'm done. Henceforth we can get at least 67, because quite intuitively, we can erase more if this is not set up this way.

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