Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Moderator Note: At the time that this question was posted, it was from an ongoing contest. The relevant deadline has now passed.

Imagine that the integers are split into sets $A$, $B$, $C$ with the restriction that the negative of an integer belonging to $A$ should belong to $B$, and ineteger that can be represented as the sum of two integers belonging to $B$ should be in $A$. It is fairly simple to show that the converse of both these restrictions should also hold true- the negative of an integer in $B$ is in $A$ and the sum of two integers in $A$ is in $B$.

In what sorts of ways can we arrange all integers in these sets?

share|cite|improve this question
Your example doesn't work, as the sums of elements of $B$ (positive integers) aren't in $A$ (negative integers). – jwodder Apr 6 '12 at 0:44

I interpret "split" as meaning $A$, $B$, $C$ must be disjoint and nonempty. Let $a_0$ be the member of $A$ with least absolute value. Then for integers $k$, $k a_0 \in A$ if $k \equiv 1 \mod 3$, $B$ if $k \equiv 2 \mod 3$, $C$ if $k \equiv 0 \mod 3$.
Moreover, every integer not a multiple of $a_0$ must be in $C$.

share|cite|improve this answer
Could you explain why this is further? Also are the roles of A and B effectively interchangeable in your solution? – Ali Apr 13 '12 at 15:58
Yes, the problem is symmetric in $A$ and $B$, and $B = -A$. – Robert Israel Apr 15 '12 at 5:51

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.