Is $p^3+4$ Prime if Both $p$ and $p^2+8$ are Prime Numbers?

  • MHB
  • Thread starter Albert1
  • Start date
  • Tags
    Prime
In summary, a prime number is a positive integer that is only divisible by 1 and itself. There are several methods for proving the primality of a number, such as trial division, Sieve of Eratosthenes, and the AKS primality test. However, it is not possible to prove that $p^3+4$ is prime for all values of p. Proving this can have implications in number theory and cryptography. Additionally, $p^3+4$ has other interesting properties such as always being a perfect square when p is an odd prime number and being a member of the Sophie Germain prime sequence.
  • #1
Albert1
1,221
0
both $p$ and $p^2+8$ are prime numbers

prove :$p^3+4 $ is also prime
 
Mathematics news on Phys.org
  • #2
Albert said:
both $p$ and $p^2+8$ are prime numbers

prove :$p^3+4 $ is also prime

proof:

p is either 2 or 3 or of the form $(6n\pm1)$

if p is of the form $(6n\pm1)$

then $p^2 + 8 = 36n^2\pm12n + 9 = 3 (12n^2 \pm4n + 3)$ divisible by 3 and the value is greater than 3 so not a prime if p = 2 then $p^2 + 8=12$ and not a prime

so only p =3 is left and $p^2+ 8 = 17$ is a prime and p =3 is the only number satisfies the given criteria and $p^3+ 4 = 31$ is a prime as well
 
  • #3
Albert said:
both $p$ and $p^2+8$ are prime numbers
prove :$p^3+4 $ is also prime
$p\neq 2$ for $2^2+8=12$ is not a prime
let $p=3k=3 (\,\,here \,\,k=1)---(1)$
then $3^2+8=17,$ and $3^3+4=31$ both are prime
if $p=3k+1(k\in N)---(2)$ then $p^2+8=9k^2+6k+9$ not prime
if $p=3k+2(k\in N)---(3)$ then $p^2+8=9k^2+12k+12$ not prime
so the only possible solution is $p=3$ and the proof is done
 
Last edited:
  • #4
I claim that$$p^2+8\equiv0\mod{3}\quad\forall\,p\ne3$$Consider$$p^2\equiv1\mod{n}$$$$p^2-1\equiv0\mod{n}$$$$(p-1)(p+1)\equiv0\mod{n}$$Now,$$p-1,p,p+1$$are three consecutive integers, hence 3 divides $p-1$ or 3 divides $p+1$ (if $p\ne3$), so we have$$p^2\equiv1\mod{3}\quad\forall\,p\ne3$$hence$$p^2+8\equiv0\mod{3}\quad\forall\,p\ne3$$Also,$$3^2+8=17$$is prime and$$3^3+4=31$$is prime, as required.$$\text{ }$$
 
Last edited:
  • #5


I understand the importance of evidence and rigorous proof in any scientific claim. In this case, we are trying to prove that $p^3+4$ is prime, given that both $p$ and $p^2+8$ are prime numbers.

First, let's start by defining what it means for a number to be prime. A prime number is a positive integer that is only divisible by 1 and itself. This means that a prime number cannot be divided by any other number to give a whole number result.

Now, let's look at the expression $p^3+4$. We can rewrite this as $(p^2)^2+4$. This suggests that $p^3+4$ is in the form of a sum of squares, which can be factored using the difference of squares formula: $a^2-b^2 = (a-b)(a+b)$.

Applying this formula to $p^3+4$, we get $(p^2+2)(p^2-2)$. Now, we know that $p^2+8$ is prime, so $p^2+2$ must be a factor of $p^2+8$. This means that $p^2+2$ cannot be divided by any other number to give a whole number result, making it a prime number.

Similarly, $p$ is also a prime number, so it cannot be divided by any other number to give a whole number result. This means that $p^2-2$ cannot be divided by any other number to give a whole number result, making it a prime number as well.

Putting this all together, we have shown that $p^3+4$ can be factored into two prime numbers, $p^2+2$ and $p^2-2$. Since these are the only factors of $p^3+4$, we can conclude that $p^3+4$ is a prime number.

In conclusion, we have proven that $p^3+4$ is prime, given that both $p$ and $p^2+8$ are prime numbers. This proof relies on the definition of prime numbers and the difference of squares formula. Therefore, we can confidently say that $p^3+4$ is indeed a prime number.
 

FAQ: Is $p^3+4$ Prime if Both $p$ and $p^2+8$ are Prime Numbers?

What is the definition of a prime number?

A prime number is a positive integer that is only divisible by 1 and itself. In other words, it has no other factors besides 1 and itself.

How can we prove that a number is prime?

There are several methods for proving the primality of a number, such as trial division, Sieve of Eratosthenes, and the AKS primality test. These methods involve testing if the number is divisible by any other number. If it is not divisible by any number besides 1 and itself, then it is a prime number.

Can we prove that $p^3+4$ is prime for all values of p?

No, we cannot prove that $p^3+4$ is prime for all values of p. In fact, for many values of p, $p^3+4$ is not a prime number. However, it is possible to prove that $p^3+4$ is prime for certain values of p by using methods such as the AKS primality test.

What is the significance of proving $p^3+4$ is prime?

Proving that $p^3+4$ is prime can have several implications in number theory and cryptography. It can provide insights into the distribution and patterns of prime numbers, and it can also be used as a building block for creating secure encryption algorithms.

Are there any other interesting properties of $p^3+4$ besides being prime?

Yes, there are other interesting properties of $p^3+4$. For example, it is always a perfect square when p is an odd prime number. It is also a member of the sequence of prime numbers called Sophie Germain primes, which are prime numbers that are 2 times a prime number plus 1.

Similar threads

Back
Top