2017/09/26 by Kevin B. Espinet, Espinet, Kevin B. · 1 voice
Mathematics · #History and Theory of Mathematics #Analytic Number Theory Research #Mathematics and Applications
paper · pdf · doi:10.48550/arxiv.1709.09950
This document seeks to prove there are infinitely many primes whose difference is 2, referred to as twin prime pairs. This proof's methodology involves constructing a function that approximates the number of positive integers, less than a known twin prime pair, which can be mapped to a twin prime pair greater than the known one by multiplication. This function is shown to be unbounded and less than the true count of integers it seeks to approximate for the majority of twin prime pairs. Additionally, it is shown there must be infinitely many integers that map a twin prime pair to one larger than itself without the use of the previously mentioned approximation.