prove that there are infinetely many primes of the form(adsbygoogle = window.adsbygoogle || []).push({});

3n+1

we used :

Assume there is a finitely # of primes of the form 3n+1

let P = product of those primes.. which is also of the form 3A+1 for some A.

Let N = (2p)^2 + 3.

Now we need to show that N has a prime divisor of the form 3n+1, which is not in the list of the ones before. This would be a contradiction. But I'm not sure how to show that.

any help would be appreciated

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Infinetely many primes of the form 3n+1

**Physics Forums | Science Articles, Homework Help, Discussion**