2008 USAMO Problems/Problem 5: Difference between revisions
create template |
I like pie (talk | contribs) Fixed link |
||
| Line 12: | Line 12: | ||
{{USAMO newbox|year=2008|num-b=4|num-a=6}} | {{USAMO newbox|year=2008|num-b=4|num-a=6}} | ||
* <url> | * <url>viewtopic.php?t=202910 Discussion on AoPS/MathLinks</url> | ||
[[Category:Olympiad Number Theory Problems]] | [[Category:Olympiad Number Theory Problems]] | ||
Revision as of 18:58, 1 May 2008
Problem
(Kiran Kedlaya) Three nonnegative real numbers 
, 
, 
are written on a blackboard. These numbers have the property that there exist integers 
, 
, 
, not all zero, satisfying 
. We are permitted to perform the following operation: find two numbers 
, 
on the blackboard with 
, then erase and write 
in its place. Prove that after a finite number of such operations, we can end up with at least one 
on the blackboard.
Solution
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.
Resources
| 2008 USAMO (Problems • Resources) | ||
| 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>
