I need to prove that there is only one $p$ prime number such that $p^2+8$ is prime and find that prime.
Anyway, I just guessed and the answer is 3 but how do I prove that?
|
I need to prove that there is only one $p$ prime number such that $p^2+8$ is prime and find that prime. Anyway, I just guessed and the answer is 3 but how do I prove that? |
||||
|
|
Any number can be written as $6c,6c\pm1,6c\pm2=2(3c\pm1),6c+3=3(2c+1)$ Clearly, $6c,6c\pm2,6c+3$ can not be prime for $c\ge 1$ Any prime $>3$ can be written as $6a\pm 1$ where $a\ge 1$ So, $p^2+8=(6a\pm 1)^2+8=3(12a^2\pm4a+3)$. Then , $p^2+8>3$ is divisible by 3,hence is not prime. So, the only prime is $3$. Any number$(p)$ not divisible by $3,$ can be written as $3b\pm1$ Now, $(3b\pm1)^2+(3c-1)=3(3b^2\pm2b+c)$. Then , $p^2+(3c-1)$ is divisible by 3 and $p^2+(3c-1)>3$ if $p>3$ and $c\ge1$,hence not prime. The necessary condition for $p^2+(3c-1)$ to be prime is $3\mid p$ $\implies$ if $p^2+(3c-1)$ is prime, $3\mid p$. If $p$ needs to be prime, $p=3$, here $c=3$ |
|||||||||||||
|
|
Suppose there exists a prime p (not equal to 3) such that $p^2+8$ is prime. Since p is indivisible by 3, therefore $p=1$ (mod 3) or $p=-1$ (mod 3), therefore $p^2=1$ (mod 3). Thus, $p^2+8=9=0$ (mod 3), therefore $p^2+8$ is a prime greater than 3 that is divisible by 3 (a contradiction). |
|||
|
|
|
Put $\rm\,q,k = 3\:$ in: $ $ for $\rm\,p\ne q\:$ primes, little Fermat $\rm\,\Rightarrow\, q\:|\: p^{q-1}\!-1+qn\ $ so it is prime iff it $\rm = q.$ |
|||
|
|