1310: Goldbach Conjectures - Revision history

2.50.3.121: /* Explanation */ If every odd number greater than 5 is the sum of 3 primes, you could just sum up two of the primes and leave one to make 2 numbers that sum to a number greater than 7. You could add one to either of the numbers to make one for the evens.

2025-06-13T06:03:36Z

‎Explanation: If every odd number greater than 5 is the sum of 3 primes, you could just sum up two of the primes and leave one to make 2 numbers that sum to a number greater than 7. You could add one to either of the numbers to make one for the evens.

B for brain: /* Explanation */

2025-06-10T08:43:49Z

‎Explanation

DKMell: mentioned proof checking, added link

2024-12-12T18:45:25Z

mentioned proof checking, added link

172.70.91.61: Undo revision 334242 by B for brain (talk) I think this point needs rewriting, for several reasons. I can see where it started going, but not fully thought through how far it goes. + &->and!

2024-02-05T17:16:48Z

Undo revision 334242 by B for brain (talk) I think this point needs rewriting, for several reasons. I can see where it started going, but not fully thought through how far it goes. + &->and!

B for brain: /* Explanation */

2024-02-05T15:00:27Z

‎Explanation

172.70.92.163: Restored joke citation needed template

2023-09-23T09:45:54Z

Restored joke citation needed template

162.158.189.112: /* Explanation */ I think It is trivially obvious that every number greater than 7 is able to be written as the sum of two other numbers.

2023-09-23T09:18:58Z

‎Explanation: I think It is trivially obvious that every number greater than 7 is able to be written as the sum of two other numbers.

172.70.115.71: added a {{citation needed}}

2023-03-21T00:47:33Z

added a {{citation needed}}

Jacky720: rv

2022-05-04T21:31:23Z

Show changes

Ex Kay Cee Dee at 21:31, 4 May 2022

2022-05-04T21:31:21Z

Show changes

@@ Line 17: / Line 17: @@
 * The "very strong" conjecture says that every odd number is prime. This is false, because some odd numbers are {{w|Composite_number|composite}} (e.g. 9, 15, 21), and composite numbers are not prime.{{citation needed}} But if this conjecture ''were'' true, it would make Goldbach's (strong) conjecture true as well, because every even number can be written as the sum of two odd numbers (which, by this "conjecture", are prime).
 * The "extremely strong" conjecture says that numbers stop at 7. {{w|8|This is false}}, but if it ''were'' true, it might make the above conjecture true as well: 9 is the first odd composite number, so stopping at 7 would eliminate all odd composite numbers. (1 is neither prime nor composite, but it ''has'' been counted as a prime number in the past. Randall may have meant 1 to be an unspoken exception, or he may be returning to the older definition that included 1 as prime.)
-* In the other direction, the "very weak" conjecture says that every number above 7 can be written as the sum of two other numbers. This is true,{{citation needed}} but as it says nothing about primes, it isn't enough to prove Goldbach's weak conjecture. The weak conjecture being true would automatically make this one true, though{{Actual citation needed}} (if we didn't already know it was true).
+* In the other direction, the "very weak" conjecture says that every number above 7 can be written as the sum of two other numbers. This is true,{{citation needed}} but as it says nothing about primes, it isn't enough to prove Goldbach's weak conjecture. The weak conjecture being true would automatically make this one true, though{{citation needed}} (if we didn't already know it was true).
 * The "extremely weak" conjecture says that "numbers just keep going". This is true, but it may not actually be implied by the above conjectures. Those say that numbers above 7 have certain properties, without ''requiring'' that such numbers exist. This may seem like a nitpicky point, but mathematicians love those; it also causes problems, because the "extremely strong" and "extremely weak" conjectures contradict each other. If the other conjectures were rewritten to say "these numbers exist, ''and'' have these properties", then they would imply this "extremely weak" conjecture, but then the "extremely strong" one would have to be stricken off.

@@ Line 17: / Line 17: @@
 * The "very strong" conjecture says that every odd number is prime. This is false, because some odd numbers are {{w|Composite_number|composite}} (e.g. 9, 15, 21), and composite numbers are not prime.{{citation needed}} But if this conjecture ''were'' true, it would make Goldbach's (strong) conjecture true as well, because every even number can be written as the sum of two odd numbers (which, by this "conjecture", are prime).
 * The "extremely strong" conjecture says that numbers stop at 7. {{w|8|This is false}}, but if it ''were'' true, it might make the above conjecture true as well: 9 is the first odd composite number, so stopping at 7 would eliminate all odd composite numbers. (1 is neither prime nor composite, but it ''has'' been counted as a prime number in the past. Randall may have meant 1 to be an unspoken exception, or he may be returning to the older definition that included 1 as prime.)
-* In the other direction, the "very weak" conjecture says that every number above 7 can be written as the sum of two other numbers. This is true,{{citation needed}} but as it says nothing about primes, it isn't enough to prove Goldbach's weak conjecture. The weak conjecture being true would automatically make this one true, though (if we didn't already know it was true).
+* In the other direction, the "very weak" conjecture says that every number above 7 can be written as the sum of two other numbers. This is true,{{citation needed}} but as it says nothing about primes, it isn't enough to prove Goldbach's weak conjecture. The weak conjecture being true would automatically make this one true, though{{Actual citation needed}} (if we didn't already know it was true).
 * The "extremely weak" conjecture says that "numbers just keep going". This is true, but it may not actually be implied by the above conjectures. Those say that numbers above 7 have certain properties, without ''requiring'' that such numbers exist. This may seem like a nitpicky point, but mathematicians love those; it also causes problems, because the "extremely strong" and "extremely weak" conjectures contradict each other. If the other conjectures were rewritten to say "these numbers exist, ''and'' have these properties", then they would imply this "extremely weak" conjecture, but then the "extremely strong" one would have to be stricken off.

@@ Line 11: / Line 11: @@
 Goldbach's {{w|Goldbach's weak conjecture|weak}} and {{w|Goldbach's conjecture|strong}} conjectures are a pair of real, unsolved problems relating to {{w|prime number}}s (a number with exactly two positive divisors, 1 and itself). The comic states these under the labels "weak" and "strong".
-* Goldbach's weak conjecture says that every odd number above 5 can be written as the sum of three prime numbers. A computer-aided proof of this was completed in 2013, but it is not yet clear whether the proof has been accepted as correct.
+* Goldbach's weak conjecture says that every odd number above 5 can be written as the sum of three prime numbers. A computer-aided proof of this was completed in 2013, but the proof is still being checked.[https://webusers.imj-prg.fr/~harald.helfgott/anglais/book.html]
 * Goldbach's strong conjecture (more often, simply "Goldbach's conjecture") says that every even number above 2 can be written as the sum of two prime numbers. If true, this would automatically make the weak conjecture true as well, because every odd number above 5 can be written as an even number above 2 (equal to two primes), plus 3 (the third prime).
@@ Line 29: / Line 29: @@
 Mathematician {{w|Christian Goldbach}} wrote a form of his conjecture (the "strong" one of the comic) in a letter to the famous {{w|Leonhard Euler}} in 1742. Euler replied that he considered it certainly true, but that he could not prove it.
-Mathematicians have been solving related problems that are "weaker" than Goldbach's weak conjecture and working towards "stronger" ones. For example, in 1937 the weak conjecture was proven for odd numbers greater than 3<sup>14348907</sup>. In 1995 a version was proven based on the sum of no more than seven prime numbers, and in 2012 the ceiling was lowered to five primes. In 2013 the weak conjecture was claimed proven for numbers greater than 10<sup>30</sup>, while all numbers below 10<sup>30</sup> have been verified by supercomputers to satisfy the conjecture; these together imply that the weak conjecture is true, although there is no ''general'' proof of it for all numbers. Goldbach's strong conjecture remains unsolved.
+Mathematicians have been solving related problems that are "weaker" than Goldbach's weak conjecture and working towards "stronger" ones. For example, in 1937 the weak conjecture was proven for odd numbers greater than 3<sup>14348907</sup>. In 1995 a version was proven based on the sum of no more than seven prime numbers, and in 2012 the ceiling was lowered to five primes. In 2013 the weak conjecture was claimed proven for numbers greater than 10<sup>30</sup> (as of 2024, [https://webusers.imj-prg.fr/~harald.helfgott/anglais/book.html checking of this proof] is ongoing), while all numbers below 10<sup>30</sup> have been verified by supercomputers to satisfy the conjecture; these together imply that the weak conjecture is true, although there is no ''general'' proof of it for all numbers. Goldbach's strong conjecture remains unsolved.
 ==Transcript==

@@ Line 22: / Line 22: @@
 The title text gives the same treatment to the {{w|Twin prime|twin prime conjecture}}, which says that there are infinitely many pairs of primes ''where one is 2 more than the other'' (e.g. 3 and 5). The title text adds a "weak" conjecture, according to which there are simply infinitely many pairs of primes (with no mention of the distance between them). This is true; {{w|Euclid's theorem}} says that there are an infinite number of primes, and so you can simply pick any two (e.g. 5 and 13) and call them a pair.
-It also adds a "strong" conjecture where ''every'' prime is now a twin prime. This is easily proven false; 23 is prime, for example, but cannot be one of a pair as neither 21 nor 25 are. However, Randall adds a humorous {{w|hedge (linguistics)|hedge}} that some prime numbers "may not look prime at first". (However, because of how the title text is worded, it technicaly means all numbers, except for 1, 0, and the negative & complex numbers, are prime.)
+It also adds a "strong" conjecture where ''every'' prime is now a twin prime. This is easily proven false; 23 is prime, for example, but cannot be one of a pair as neither 21 nor 25 are. However, Randall adds a humorous {{w|hedge (linguistics)|hedge}} that some prime numbers "may not look prime at first".
 Lastly, the tautological prime conjecture states that it itself is true while making no statement about primes. It is not technically a {{w|tautology}} but more of a plain assertion. Randall has mentioned tautologies before in [[703: Honor Societies]].

@@ Line 22: / Line 22: @@
 The title text gives the same treatment to the {{w|Twin prime|twin prime conjecture}}, which says that there are infinitely many pairs of primes ''where one is 2 more than the other'' (e.g. 3 and 5). The title text adds a "weak" conjecture, according to which there are simply infinitely many pairs of primes (with no mention of the distance between them). This is true; {{w|Euclid's theorem}} says that there are an infinite number of primes, and so you can simply pick any two (e.g. 5 and 13) and call them a pair.
-It also adds a "strong" conjecture where ''every'' prime is now a twin prime. This is easily proven false; 23 is prime, for example, but cannot be one of a pair as neither 21 nor 25 are. However, Randall adds a humorous {{w|hedge (linguistics)|hedge}} that some prime numbers "may not look prime at first".
+It also adds a "strong" conjecture where ''every'' prime is now a twin prime. This is easily proven false; 23 is prime, for example, but cannot be one of a pair as neither 21 nor 25 are. However, Randall adds a humorous {{w|hedge (linguistics)|hedge}} that some prime numbers "may not look prime at first". (However, because of how the title text is worded, it technicaly means all numbers, except for 1, 0, and the negative & complex numbers, are prime.)
 Lastly, the tautological prime conjecture states that it itself is true while making no statement about primes. It is not technically a {{w|tautology}} but more of a plain assertion. Randall has mentioned tautologies before in [[703: Honor Societies]].

@@ Line 15: / Line 15: @@
 Randall's further conjectures extend this to a whole series of progressively "weaker" and "stronger" statements. His weak conjectures are so weak that they are obviously true; his strong conjectures are so restrictive that they are obviously false. However, for the most part, they really do maintain a weak-strong relationship.
-* The "very strong" conjecture says that every odd number is prime. This is false, because some odd numbers are {{w|Composite_number|composite}} (e.g. 9, 15, 21), and composite numbers are not prime. But if this conjecture ''were'' true, it would make Goldbach's (strong) conjecture true as well, because every even number can be written as the sum of two odd numbers (which, by this "conjecture", are prime).
+* The "very strong" conjecture says that every odd number is prime. This is false, because some odd numbers are {{w|Composite_number|composite}} (e.g. 9, 15, 21), and composite numbers are not prime.{{citation needed}} But if this conjecture ''were'' true, it would make Goldbach's (strong) conjecture true as well, because every even number can be written as the sum of two odd numbers (which, by this "conjecture", are prime).
 * The "extremely strong" conjecture says that numbers stop at 7. {{w|8|This is false}}, but if it ''were'' true, it might make the above conjecture true as well: 9 is the first odd composite number, so stopping at 7 would eliminate all odd composite numbers. (1 is neither prime nor composite, but it ''has'' been counted as a prime number in the past. Randall may have meant 1 to be an unspoken exception, or he may be returning to the older definition that included 1 as prime.)
 * In the other direction, the "very weak" conjecture says that every number above 7 can be written as the sum of two other numbers. This is true,{{Citation needed}} but as it says nothing about primes, it isn't enough to prove Goldbach's weak conjecture. The weak conjecture being true would automatically make this one true, though (if we didn't already know it was true).