Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
Overkott proves Goldbach
2 views
Skip to first unread message
Bonaventura
Mar 21, 2023, 1:29:10 PM3/21/23
to
Goldbach's conjecture, named after the mathematician Christian Goldbach, is an unproven statement from the field of number theory. As one of Hilbert's problems (No. 8b), it is one of the best-known unsolved problems in mathematics.
https://de.wikipedia.org/wiki/Goldbachsche_Vermutung
Overkott's proof:
1. The set of natural numbers consists only of even and odd numbers.
2. The odd numbers are always prime numbers or pseudo prime numbers ( prime number products ).
3. Prime numbers occur more frequently than prime number products.
4. The number of ways in which a sum can be represented corresponds to the value of the number.
5. Because of the commutative law, only half of the sums have to be considered.
6. Of this, half of the sums with even numbers are omitted.
7. The remaining sums can only contain prime numbers or pseudo-prime numbers.
8. Prime numbers are great.
9. Because prime numbers occur more frequently than prime number products: With the other sums, there are always more ways of representing a sum of two prime numbers than sums with at least one pseudo-prime number.
https://de.wikipedia.org/wiki/Goldbachsche_Vermutung
Overkott's proof:
1. The set of natural numbers consists only of even and odd numbers.
2. The odd numbers are always prime numbers or pseudo prime numbers ( prime number products ).
3. Prime numbers occur more frequently than prime number products.
4. The number of ways in which a sum can be represented corresponds to the value of the number.
5. Because of the commutative law, only half of the sums have to be considered.
6. Of this, half of the sums with even numbers are omitted.
7. The remaining sums can only contain prime numbers or pseudo-prime numbers.
8. Prime numbers are great.
9. Because prime numbers occur more frequently than prime number products: With the other sums, there are always more ways of representing a sum of two prime numbers than sums with at least one pseudo-prime number.
0 new messages