The Goldbach Conjecture states that every even integer greater than 4 can be expressed as the sum of two odd primes. In this paper, the proof of Goldbach conjecture is guided by the approach for finding Goldbach partitions. This approach leads directly to evidence that every even integer greater than 4 is the sum of two odd primes. The main principle for finding Goldbach partitions from a known partition is the application of the addition axiom to a Goldbach partition equation. It is shown that given an equation for a Goldbach partition, one can produce a Goldbach partition for any even integer greater than 4. Beginning with the partition equation, 6 = 3 + 3, and applying the addition of a 2 to both sides of this equation, and subsequent equations, one obtained Goldbach partitions for over 180 consecutive even integers. The repetitive process involved in the partition production was compared to the repetitive process in compound interest calculations. A consequent generalized procedure also produced Goldbach partitions for the non-consecutive even integers, 100; 1000; 372,131,740; and 400,000,001,1000. An equation derived for the Goldbach partition shows that every even integer greater than 4 can be written as the sum of two odd prime integers.