Return to Question

What are the main ideas of Harald Helfgott's proof that all odd $n \geq 5$ is the sum of 3 primes?

This is breaking news, but is there a general feeling that the proof is correct?

Edit: As Greg Martin points out, the proof is expected to be right, so the second question is not necessary.

However, I still think that the first question is valid. This is a major development in Number Theory and it would be nice to see the MO community discussing the details. Judging by the number of views in 4 days and the votes to reopen, people seem interested, so please consider reopening.

If and when it reopens, I will edit this comment away to keep only the actual question.

What are the main ideas of Harald Helfgott's proof that all odd $n \geq 5$ is the sum of 3 primes?

What are the main ideas of Harald Helfgott's proof that all odd $n \geq 5$ is the sum of 3 primes?

This is breaking news, but is there a general feeling that the proof is correct?

Update: The second question is not even necessary as it seems that there is agreement already. However, I still think that the first question is valid. Even though it has been answered, it can be reopened to allow further discussion of the proof details.

If and when it reopens, I will edit this comment away to keep only the actual question.

What are the main ideas of Harald Helfgott's proof that all odd $n \geq 5$ is the sum of 3 primes?

This is breaking news, but is there a general feeling that the proof is correct?

Edit: As Greg Martin points out, the proof is expected to be right, so the second question is not necessary. 

However, I still think that the first question is valid. This is a major development in Number Theory and it would be nice to see the MO community discussing the details. Judging by the number of views in 4 days and the votes to reopen, people seem interested, so please consider reopening.

If and when it reopens, I will edit this comment away to keep only the actual question.

What are the main ideas of Harald Helfgott's proof that all odd $n \geq 5$ is the sum of 3 primes?

This is breaking news, but is there a general feeling that the proof is correct?

Update: It seems that the second question is not even necessary; it seems there is agreement already. However, I still think that the first question is valid. Even though it has been answered, I think it can be reopened to allow further discussion of the proof details.

If and when it reopens, I will edit this comment away to keep only the actual question.

What are the main ideas of Harald Helfgott's proof that all odd $n \geq 5$ is the sum of 3 primes?

This is breaking news, but is there a general feeling that the proof is correct?

Update: The second question is not even necessary as it seems that there is agreement already. However, I still think that the first question is valid. Even though it has been answered, it can be reopened to allow further discussion of the proof details.

If and when it reopens, I will edit this comment away to keep only the actual question.