PRIME NUMBERS AND GOLDBACH'S CONJECTURE
In 1742, Christian Goldbach wrote to Leonard Euler speculating that every even number greater than four can be expressed as the sum of two prime numbers, a prime number being such that it can only be divided by one and itself. Non-prime or composite numbers have various factors. While this conjecture has been shown to be correct up to very large numbers there has been no proof, so far, that it is always true, except when half the even number is a prime number. With the exception of 2, all even numbers are composite numbers. Odd numbers can be either prime or composite. While the number one is not considered to be a prime number, in this study it will used as a substitute for two since only odd numbers are considered. . Odd numbers can be derived from one of three equations, y = 3 + 6x, y = 5 +6x and y = 7 + 6x, where x is an integer. While the first equation only gives composite numbers the other two give a mixture of composite and prime numbers. While prime numbers do not show any r