Prove equations in modular arithmetic Prove or disprove the following statement in modular arithmetic.


*

*If $a\equiv b \mod m$, then $ a^2\equiv b^2 \mod m$

*If $a\equiv b \mod m$, then $a^2\equiv b^2 \mod m^2$

*If $a^2\equiv b^2\mod m^2$, then $a\equiv b\mod m$



My proofs. 


*

*$$ a\equiv b \mod m \implies (a-b) = mr, r\in\mathbb{Z}$$
$$ a^2-b^2 = (a+b)(a-b) = (a+b)mr = ms \text{ where } s = (a+b)\cdot r$$
So the first statement is true

*$$ a\equiv b \mod m \implies (a-b) = mr, r\in\mathbb{Z}$$
$$a^2-b^2 = (a+b)(a-b) = (a+b)mr$$ 
but $(a+b)\neq ms$ $\forall s\in\mathbb{Z}$ in general. So the second one is false.

*$$a^2-b^2 = m^2r, \exists r\in\mathbb{N}$$ 
$$a^2-b^2= (a+b)(a-b) $$ 
Then I kind of got stuck here. I'm not sure how to continue it. Am I missing some properties I don't know? Or there is a algebra trick that could be applied here?

For Question 3, you are told that $m^2$ divides $a^2-b^2$, and are asked whether (necessarily) $m$ divides $a-b$. 
Note that $a^2-b^2=(a-b)(a+b)$.  Maybe the "factor" $m^2$ comes in whole or in large part from $a+b$, not from $a-b$. Let's see whether we can find an example. Let $m=3$, so $m^2=9$. Make $a+b$ divisible by $9$, for example by taking $a=8$, $b=1$. Then $a-b=7$, very much not divisible by $3$.
There is no example with $m=2$, but you can use the same idea to find an example with $m=4$. We want $(a-b)(a+b)$ to be divisible by $16$, with $a-b$ not divisible by $4$. We can for example take $a=15$, $b=1$, or $a=13$, $b=3$, or $a=7$, $b=1$. For all these examples, $a^2\equiv b^2\pmod{4^2}$ but $a \not\equiv b\pmod{4}$. 
Now make up your own counterexample!
