Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: professors of Stanford endorsing proof of Goldbach to arxiv
Replies: 20   Last Post: Sep 5, 2014 4:14 AM

 Messages: [ Previous | Next ]
 plutonium.archimedes@gmail.com Posts: 18,572 Registered: 3/31/08
new Conjecture Primes the sum or subtraction of two perfect squares
Re: professors of Stanford endorsing proof of Goldbach to arxiv

Posted: Sep 4, 2014 12:55 AM

On Wednesday, August 27, 2014 1:16:50 PM UTC-5, Archimedes Plutonium wrote:
> Found the Euler formula:
>
>
>
> F(n) = n^2 + n + 41 which is good for integers from 0 to 39 for a long string of primes:
>

Alright, I am not getting anywhere with this, and said at the beginning it is unlikely that having an infinity borderline makes any changes to the status that primes have no orderly rule.

However, let me change course here and pit the primes with perfect-squares in another Goldbach type relationship:

Conjecture: Every prime number is the sum or subtraction of two perfect-squares.

Let me start the list:

1+1 = 2
4-1 = 3
9-4 = 5
16-9 = 7
36-25 = 11
9+4 =13

It appears I can keep on going for all the primes.

Now if I can, what would be a proof? Would it utilize anything used in the proof of Goldbach or would I have to start stone cold with nothing?

AP