On the existence of a non-zero lower bound for the number of Goldbach partitions of an even integer
The Goldbach partitions of an even number greater than 2, given by the sums of two prime addends, form the non-empty set for all integers 2n with 2 ≤ n ≤ 2 × 1014. It will be shown how to determine by the method of induction the existence of a non-zero lower bound for the number of Goldbach partitio...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Universität Potsdam
2002
|
| Subjects: | |
| Online Access: | http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-26474 http://opus.kobv.de/ubp/volltexte/2008/2647/ |
| Summary: | The Goldbach partitions of an even number greater than 2, given by the sums of two prime addends, form the non-empty set for all integers 2n with 2 ≤ n ≤ 2 × 1014. It will be shown how to determine by the method of induction the existence of a non-zero lower bound for the number of Goldbach partitions of all even integers greater than or equal to 4. The proof depends on contour arguments for complex functions in the unit disk. |
|---|