Partitioning an even number of the new formulation into all pairs of odd numbers

Abstract

We present a new algorithm for partitioning an even number of the form (p1 + p2) + (p2 – p1)n [1] into pairs of odd numbers. We have also presented a general proof of partitioning the even number of this form into all pairs of odd numbers. Since prime numbers greater than 2 are subsets of odd numbers, it is expected that in these pairs of odd numbers, there exist at least one Goldbach’s partition. These results could therefore have remarkable application to the solution to the Strong Goldbach’s Conjecture.