Difference between revisions of "2007 IMO Problems/Problem 5"
(commenting out solution with a flaw---may be salvageable) |
(→Resources) |
||
Line 48: | Line 48: | ||
{{IMO box|year=2007|num-b=4|num-a=6}} | {{IMO box|year=2007|num-b=4|num-a=6}} | ||
− | * <url> | + | * <url>viewtopic.php?p=894656#p894656 Discussion on AoPS/MathLinks</url> |
[[Category:Olympiad Number Theory Problems]] | [[Category:Olympiad Number Theory Problems]] |
Latest revision as of 01:58, 18 December 2009
Problem
(Kevin Buzzard and Edward Crane, United Kingdom) Let and be positive integers. Show that if divides , then .
Solution
Lemma. If there is a counterexample for some value of , then there is a counterexample for this value of such that .
Proof. Suppose that . Note that , but . It follows that . Since it follows that can be written as , with . Then is a counterexample for which .
Now, suppose a counterexample exists. Let be a counterexample for which is minimal and . We note that and Now, Thus is a counterexample. But , which contradicts the minimality of . Therefore no counterexample exists.
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.
Resources
2007 IMO (Problems) • Resources | ||
Preceded by Problem 4 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 6 |
All IMO Problems and Solutions |
- <url>viewtopic.php?p=894656#p894656 Discussion on AoPS/MathLinks</url>