On an Algorithm to Prove the Strong Goldbach Conjecture

Abstract

The strong Goldbach conjecture says that any even number greater than the integer can be expressed as the sum of two prime numbers which has been numerically justified up to such large numbers that of order 4 . We assume the conjecture is true for all numbers and provide simple algorithm to prove the conjecture for a special class of even numbers first. Secondly we point how the conjecture may be proved in general.