A recursion relation for the number of Goldbach partitions of an even integer

Abstract

The contour integral representation of the number of Goldbach partitions of an even integer, G(n), is extended to an integral with a support function that equals a linear combination of integers {G(m)}. A support function is found such that there is a nontrivial integral relation relating number of Goldbach partitions of n and m < n. The proof of the existence of a partition of any even integer greater than or equal to four into the sum of two primes follows from a recursion relation, resulting from an integral identity, that yields a non-zero lower bound for G(n). A partition of n, given a partition of n/2 , is derived from an algorithm based on solutions to congruence relations related to the roots of unity. This result provides a method for generating a prime partition of every even integer greater than or equal to 6 in addition to the above demonstration of its existence.