Is there a conjecture or result such that if it's proven to be true would automatically prove (the Strong) Goldbach's conjecture?

Asked Dec 26 '20 at 10:55

Active Dec 26 '20 at 13:18

Viewed 81 times

I'm just wondering if there's any existing conjectures or results such that if they're proven to be true, Goldbach's conjecture would also be proven to be true.

Additional Information:

I've looked at the other post about equivalents of the strong Goldbach's conjecture here:

What are some equivalent statements of (strong) Goldbach Conjecture?

But what I mean here is a conjecture not equivalent to Goldbach's, that if proved would imply Goldbach's conjecture is true.

edited Dec 26 '20 at 13:18

asked Dec 26 '20 at 10:55

JCr

8

Yes. One such conjecture is Goldbach's conjecture. – TheSimpliFire Dec 26 '20 at 11:01
2

Already answered here – Aven Desta Dec 26 '20 at 11:04
I assume you mean the strong version (the weak version is implied by the generalized riemann hypothesis and has been solved in the mean time). I am not aware of a conjecture implying the strong version. – Peter Dec 26 '20 at 11:06
1

I've added some additional information in the question for clarification. – JCr Dec 26 '20 at 13:25
1

$7$ upvotes for a neither helpful nor funny comment. – Peter Dec 26 '20 at 13:44
@Peter your last comment isn't helpful nor funny either , so... – jjagmath Dec 26 '20 at 14:39
@jjagmath So, pointing out unsuitable comments is not helpful ? But the good news for you : My flag was declined, so the moderators are apparently with you. – Peter Dec 26 '20 at 14:44
Yes if certain inequalities among modular prime counting functions are true they prove Goldbach... – Roddy MacPhee Jun 06 '21 at 01:50

Is there a conjecture or result such that if it's proven to be true would automatically prove (the Strong) Goldbach's conjecture?

0 Answers0