Art of Problem Solving

1996 USAMO Problems/Problem 6: Difference between revisions

1=2 (talk | contribs)
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..."
 
1=2 (talk | contribs)
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 $X$ of the integers with the following property: for any integer $n$ there is exactly one solution of $a + 2b = n$ with $a,b \in X$.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See Also

1996 USAMO (ProblemsResources)
Preceded by
Problem 5
Followed by
Last Problem
1 2 3 4 5 6
All USAMO Problems and Solutions

These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. Error creating thumbnail: File missing