Prove that if $(u,v)$ is chosen randomly from $S$, there is at least a $50\%$ chance that $u\ne\pm v \bmod N$ I need serious help with this problem. 
Suppose $N$ is an odd composite number and $S=\{(x,y) \in \mathbb Z^2 : x^2 \equiv y^2 \mod N\}$


*

*Prove that if $(u,v)$ is chosen randomly from $S$, there is at least a $50\%$ chance that $u \not \equiv \pm v \bmod N$


Attempt:
since $(x,y)$ satisfy $x^2 \equiv y^2 \mod N$
then $x^2 - y^2 \equiv 0 \mod N$
so, 
$(x-y)(x+y)=0 \mod n$
and we know that n is a composite number, so there are prime factor p and q such that n=pq
so
$(x-y)(x+y)=0 \bmod pq$
and by Chinese Remainder Theorem we deduce
$(x-y)(x+y)=0 \bmod p$   
and 
$(x-y)(x+y)=0 \bmod q$
so
$(x-y)(x+y)=kpq$
$(x-y)(x+y)/(pq)=k$
for some constant $k$
that's pretty much all i got, I'm not sure how to finish the proof. any help would be greatly appreciated.

Let $n=15$, and fix $y$. We find the probability that if $0\le x\lt 15$, and $x^2\equiv y^2\pmod{15}$, then $x\equiv \pm y\pmod{15}$.
It is not hard to verify that if $y$ is relatively prime to $15$, then there are precisely $4$ values of $x$ such that $x^2\equiv y^2\pmod{15}$. Thus for such $y$ the probability is exactly $50\%$.
If $y^2\equiv 0\pmod{15}$, then $x\equiv y \pmod{15}$. For such $y$, the probability that $x\not\equiv \pm y\pmod{15}$ is $0$. 
We cannot have $y^2\equiv 3\pmod{15}$, or $y^2\equiv 5$, or $y^2\equiv 12$.
Now look at $y^2\equiv 6\pmod{15}$. The only $x$ such that $x^2\equiv y^2\pmod{15}$ are $x\equiv \pm 6$. Thus if $y^2\equiv 6\pmod{15}$, the probability that $x\not\equiv \pm y\pmod{15}$ is $0$.
We can deal similarly with $y^2\equiv 9\pmod{15}$ and $y^2\equiv 10\pmod{15}$.  
Thus the assertion we were asked to prove is not true. 
Remark: If we specify in addition that $x$ and $y$ are relatively prime to $n$, then it is indeed true that the probability that $x\not\equiv \pm y\pmod{n}$ is $\ge \frac{1}{2}$, unless $n$ is a prime power. This can be done by a Chinese Remainder Theorem argument.
If $n$ is not a prime power, let $n=ab$ where $a$ and $b$ are relatively prime. Fix $y$. Then the congruence $x^2\equiv y^2\pmod{a}$ has at least two solutions, $x\equiv y$ and $x\equiv -y$. 
The same is true modulo $b$.
By the CRT, we can find $x$ such that $x\equiv y\pmod{a}$ and $x\equiv -y\pmod{b}$. This $x$ is not congruent to $y$ or $-y$ modulo $ab$. Neither is $-x$.  
