arXiv subjects
Publications and source records attributed to Tom Milner-Gulland.
A work by Nicolas has shown that if it can be proven that a certain inequality holds for all $n$, the Riemann hypothesis is true. This inequality is associated with the Mertens theorem, and hence the Euler totient at $\prod_{k=1}^n p_k$, where $n$ is any integer and $p_n$ is the $n$-th prime. We shall show that indeed the Nicolas inequality holds for all $n$.
This paper proposes, and demonstrates the efficacy of, an elementary method for establishing a lower bound for cardinalities of selected sets of twin primes, and shows that the proof employed may be modified for selected sets of Goldbach pairs. Our sieve method is centred on the restrictive properties of intervals, specifically regarding divisibility distributions. We implicitly use the Chinese Remainder Theorem by way of the use of the midpoint in our intervals, and consider the sieve of Eratosthenes in such a way as to find a set of primes whose distribution is mirror-symmetrical about that midpoint. Bounds are established through the use of the formulae closely associated with the Prime Number theorem and the Mertens theorem. We show that the Goldbach conjecture is true if the Riemann hypothesis is true.