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: If n is odd and n|(a-b) and n|(a+b) then n|a and n|b

since n is odd, there is some number k such that


there are also integers p,q such that

$np=(a-b)$ and $nq = (a+b)$

(We want to show there are integers r,s such that)



I've only managed to make it this far into the proof, However, I've noted a few observations.

  1. p and q could be either odd or even
  2. a and b must be odd in order for their sum or difference to be divisible by n

Furthermore, my goal is to show that there are some integers r,s that are divisible by n.

I have attempted substitution, but it seems to be leading to dead ends.

share|cite|improve this question
n divides a-b and a+b hence n divides their sum (a-b)+(a+b)=2a. Now, you know that n divides 2a and you want to show that n divides a. Which is easy since... – Did Nov 2 '11 at 18:36
up vote 1 down vote accepted

since $n|a-b$ and $n|a+b$ then $n|2a$ now since $n$ is odd then $n$ and $2$ are coprime, hence by Euclid's Lemma we have that $n|a$.

Similarly $n|-2b$ hence $n|2b$ and again by Euclid's Lemma $n|b$.

share|cite|improve this answer

HINT. If $d$ divides $x$ and $y$, then it divides $x+y$ and $x-y$.

HINT 2. If $d$ divides $xz$, and $\gcd(d,z)=1$, then $d$ divides $x$.

share|cite|improve this answer

Your Answer


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