Prove that for all integers $a$ and $b$ that $a + b$ and $a − b$ are either both odd or both even.
Stumped on this proof. I've only been able to figure it out assuming that both a and b are even:
$a = 2k$ and $b = 2n$
$2k + 2n = 2(k + n)$, definitely even. $2k - 2n = 2(k - n)$, also definitely even.
I don't think that this is the best way to go about proving this though.
let $a,b,p,q \in \mathbb{Z}$ $$ (a \mbox{ is even}) \land (b \mbox{ is even}) \implies \begin{cases} a=2p\\ b=2q \end{cases} \implies \begin{cases} a+b=2(p+q)&\mbox{(even)}\\ a-b=2(p-q)&\mbox{(even)} \end{cases} $$ $$ (a \mbox{ is even}) \land (b \mbox{ is odd}) \implies \begin{cases} a=2p\\ b=2q+1 \end{cases} \implies \begin{cases} a+b=2(p+q)+1&\mbox{(odd)}\\ a-b=2(p-q)-1&\mbox{(odd)} \end{cases} $$ $$ (a \mbox{ is odd}) \land (b \mbox{ is even}) \implies \begin{cases} a=2p+1\\ b=2q \end{cases} \implies \begin{cases} a+b=2(p+q)+1&\mbox{(odd)}\\ a-b=2(p-q)+1&\mbox{(odd)} \end{cases} $$ $$ (a \mbox{ is odd}) \land (b \mbox{ is odd}) \implies \begin{cases} a=2p+1\\ b=2q+1 \end{cases} \implies \begin{cases} a+b=2(p+q+1)&\mbox{(even)}\\ a-b=2(p-q)&\mbox{(even)} \end{cases} $$ or more elegantly: $$ (a+b)-(a-b)=2b \iff (a+b)=(a-b) + 2b \implies (a+b)=(a-b) + \mbox{(even number)} $$ so considering $a-b$ parity and using the above result: $$ (a-b) \mbox{ is odd} \implies (a+b)=\mbox{(odd)} + \mbox{(even)}=\mbox{(odd number)}\\ (a-b) \mbox{ is even} \implies (a+b)=\mbox{(even)} + \mbox{(even)}=\mbox{(even number)} $$