On Partitions of Goldbach's Conjecture

dc.creatorWoon, Max S. C.
dc.date2000-10-03
dc.date2000-10-04
dc.date.accessioned2026-07-07T04:37:48Z
dc.date.available2026-07-07T04:37:48Z
dc.descriptionAn approximate formula for the partitions of Goldbach's Conjecture is derived using Prime Number Theorem and a heuristic probabilistic approach. A strong form of Goldbach's conjecture follows in the form of a lower bounding function for the partitions of Goldbach's conjecture. Numerical computations suggest that the lower and upper bounding functions for the partitions satisfy a simple functional equation. Assuming that this invariant scaling property holds for all even integer $n$, the lower and upper bounds can be expressed as simple exponentials.
dc.identifierhttps://arxiv.org/abs/math/0010027
dc.identifierhttp://arxiv.org/abs/math/0010027
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/60041
dc.subjectGeneral Mathematics
dc.subjectNumber Theory
dc.titleOn Partitions of Goldbach's Conjecture
dc.typetext

Files

Collections