Some problems in mathematics remain buried deep in the catacombs of slow progress. Whether in Algebra, Topology, Discrete Math, or Analysis, mind-stretching mysteries await to be discovered beyond the boundaries of former thought. Frequently, solutions to such problems come from a clever combination of previously known results. In conjunction with this concept, it is often helpful to reformulate open problems into equivalent statements to gain different perspectives.
As an example, the unsolved Strong Goldbach Conjecture, that proposes every even integer greater than 2 is the sum of two prime numbers, can be reformulated into an equation involving Euler’s Totient function. By definition, two integers and are said to be relatively prime if the greatest common divisor of and is 1, denoted . For instance, let = 3 and = 5. Since there are no divisors greater than 1 that is shared between 3 and 5, notably both being prime numbers, the . Therefore, 3 and 5 are said to be relatively prime. With this in mind, Euler’s Totient function, denoted , is the total number of positive integers less than or equal to such that they are relatively prime to .
Intuitively, for every prime number p and integer , , and therefore = – 1. Given this, the statement of the Strong Goldbach Conjecture can be restated as: for every integer , there exists primes p and q such that The mathematicians Paul Erdős and Leo Moser further asked whether or not there exists any integers p and q, not necessarily prime, such that the reformulated statement holds.
In considering the proposition of Erdős and Moser, such questions provide a good starting point for solving the harder problem of considering p and q such that they are necessarily prime. It does so by seeking to expose the nature of the equation in general. Reformulations of this type provide a digging tool that could one day unearth a proof to the Strong Goldbach Conjecture, and other unsolved conundrums, from the catacombs of mathematical lethargy.