disprove the conjecture: There are infinitely many prime numbers expressible in the form n^3 +1 where n is a positive integer

Printable View

- Sep 2nd 2008, 03:26 PMrmpatel5prime number conjecture
disprove the conjecture: There are infinitely many prime numbers expressible in the form n^3 +1 where n is a positive integer

- Sep 2nd 2008, 03:49 PMThePerfectHacker
- Sep 2nd 2008, 03:51 PMrmpatel5
I have that part: n^3 +1= (n+1)(n^2-n+1). Just dont know where to go from. I know that 2 is the only integer that will work but i just dont know how to prove it.

- Sep 2nd 2008, 03:54 PMThePerfectHacker
- Sep 2nd 2008, 05:53 PMrmpatel5
so anything that factors can not be prime because that makes it a composite?

- Sep 2nd 2008, 08:23 PMThePerfectHacker