Difference between revisions of "1996 USAMO Problems/Problem 6"
(Created page with "==Problem== Determine (with proof) whether there is a subset <math>X</math> of the integers with the following property: for any integer <math>n</math> there is exactly one so...") |
m (→See Also) |
||
Line 6: | Line 6: | ||
==See Also== | ==See Also== | ||
− | + | {{USAMO newbox|year=1996|num-b=5|after=Last Problem}} | |
{{MAA Notice}} | {{MAA Notice}} | ||
[[Category:Olympiad Combinatorics Problems]] | [[Category:Olympiad Combinatorics Problems]] |
Revision as of 08:33, 20 July 2016
Problem
Determine (with proof) whether there is a subset of the integers with the following property: for any integer there is exactly one solution of with .
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
1996 USAMO (Problems • Resources) | ||
Preceded by Problem 5 |
Followed by Last Problem | |
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.