Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

1996 USAMO Problems/Problem 6

Revision as of 08:31, 20 July 2016 by 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...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1996_USAMO_Problems/Problem_6&oldid=79630"