On Primes of the Form 2x-q (where q is a prime less than or equal to x) and the Product of the Distinct Prime Divisors of an Integer (Revised): A Function Approach to Proving the Goldbach Conjecture by Mathematical Induction

This paper is really an attempt to solve the age-old problem of the Goldbach Conjecture, by restating it in terms of primes of the form 2x-q (where q is a prime less than or equal to x). Restating the problem merely requires us to ask the question: Does a prime of form 2x-q lie in the interval [x, 2x]? We begin by introducing the product, m, of numbers of the form 2x-q. Using the geometric series, an upper bound is estimated for the function m. Next, we prove a theorem that states every even number, 2x, that violates Goldbach’s Conjecture must satisfy an inequality involving a simple multiplicative function defined as the product, ρ(m), of the distinct prime divisors of m. A proof of the Goldbach Conjecture is then evident by contradiction as a corollary to the proof of the inequality.