Difference between revisions of "1998 USAMO Problems/Problem 1"
m (→See Also) |
|||
Line 14: | Line 14: | ||
[[Category:Olympiad Number Theory Problems]] | [[Category:Olympiad Number Theory Problems]] | ||
+ | {{MAA Notice}} |
Revision as of 12:34, 4 July 2013
Problem
Suppose that the set has been partitioned into disjoint pairs
(
) so that for all
,
equals
or
. Prove that the sum
ends in the digit
.
Solution
If , then
.
For integers M, N we have .
So we also have also, so
.
See Also
1998 USAMO (Problems • Resources) | ||
Preceded by First Question |
Followed by Problem 2 | |
1 • 2 • 3 • 4 • 5 • 6 | ||
All USAMO Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.