On the existence of a non-zero lower bound for the number of Goldbach partitions of an even integer

Simon Davis

International Journal of Mathematics and Mathematical Sciences, 2004, vol. 2004, 1-10

Abstract:

The Goldbach partitions of an even number, given by the sums of two prime addends, form the nonempty set for all integers 2 n with 2 ≤ n ≤ 2 × 10 14 . 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.

Date: 2004
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2004/304212.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2004/304212.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:304212

DOI: 10.1155/S0161171204307295

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().