Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

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

Prove that among any 3 integers there are always two whose difference is divisible by 2.

share|cite|improve this question
Can you show some effort, i.e. what ides have you tried so far? – dmm Nov 13 '12 at 6:33
Not if 2 or more of them can be the same! – Dale M Apr 5 '13 at 8:40

HINT: Is the difference of two even numbers divisible by $2$? What about the difference of two odd numbers?

share|cite|improve this answer

Assume your integers are $x_1<x_2<x_3$. If both $x_2-x_1$ and $x_3-x_2$ are odd, then $x_3-x_1=(x_3-x_2)+(x_2-x_1)$ is a sum of two odd numbers and therefore even.

share|cite|improve this answer

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.