Deduce that there exists a prime $p$ where $p$ divides $x^2 +2$ and $p≡3$ (mod 4) I am revising for a number theory exam and have a question that I am struggling with, any help would be greatly appreciated.
First I am asked to show that for an odd number $x$, $x^2+2 ≡3$(mod 4).  
I can do this part of the question, but next I am asked to deduce that there exists a prime $p$ where $p$ divides $x^2 +2$ and $p≡3$ (mod 4)
I am struggling to see how to attempt the second part and how the first part relates.
My thoughts so far are that I want to show $x^2≡-2$(mod p) ?
 And perhaps Fermat's Little Theorem could be of use here somehow?
Not sure if I'm barking up the wrong tree though.    
Thanks in advance.

Our number $x^2+2$ is odd, and greater than $1$, so it is a product of odd not necessarily distinct primes. If all these primes were congruent to $1$ modulo $4$, their product would be congruent to $1$ modulo $4$. But you have shown that $x^2+2\equiv 3\pmod{4}$.
