and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of

Abstract not found

An approximate formula for the partitions of Goldbach’s Conjecture is derived using Prime Number Theorem and a 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. 1 Goldbach’s Conjecture and Recent Progress Goldbach’s Conjecture states that every even integer> 2 can be expressed as a sum of two primes. The proof remains an unsolved problem since Goldbach first wrote the conjecture in a letter to Euler in 1792. However, significant progress has been made in recent years. On the front of verifying Goldbach’s Conjecture, no counter-example has