Two approaches to proving Goldbach's conjecture

Bernard Farley

Goldbach's conjecture states that "all even numbers greater than 2 can be expressed as the sum of two primes". An equivalent statement of Goldbach's conjecture was found to be "for every integer n greater than or equal to 2, there exists an integer j such that n+j and n-j are prime numbers". The purpose of the research was to approach Goldbach's conjecture using this equivalent statement. It resulted in two conjectures concerning Goldbach's conjecture. One involved a specially created sequence and another involved a lower bound that was found using counting methods.