2008 USAMO Problems/Problem 5

Revision as of 19:58, 1 May 2008 by I like pie (talk | contribs) (Fixed link)


(Kiran Kedlaya) Three nonnegative real numbers $r_1$, $r_2$, $r_3$ are written on a blackboard. These numbers have the property that there exist integers $a_1$, $a_2$, $a_3$, not all zero, satisfying $a_1r_1 + a_2r_2 + a_3r_3 = 0$. We are permitted to perform the following operation: find two numbers $x$, $y$ on the blackboard with $x \le y$, then erase $y$ and write $y - x$ in its place. Prove that after a finite number of such operations, we can end up with at least one $0$ on the blackboard.


Solution 1

Solution 2

Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.


2008 USAMO (ProblemsResources)
Preceded by
Problem 4
Followed by
Problem 6
1 2 3 4 5 6
All USAMO Problems and Solutions
  • <url>viewtopic.php?t=202910 Discussion on AoPS/MathLinks</url>
Invalid username
Login to AoPS