János Pintz (; born 20 December 1950 in Budapest) is a Hungarian mathematician working in analytic number theory. He is a fellow of the Rényi Mathematical Institute and is also a member of the Hungarian Academy of Sciences. In 2014, he received the Cole Prize of the American Mathematical Society.
Pintz is best known for proving in 2005 (with Daniel Goldston and Cem Yñldñrñm) that
where denotes the n<sup>th</sup> prime number. In other words, for every õ > 0, there exist infinitely many pairs of consecutive primes p<sub>n</sub> and p<sub>n+1</sub> that are closer to each other than the average distance between consecutive primes by a factor of õ, i.e., p<sub>n+1</sub> â p<sub>n</sub> < õ log p<sub>n</sub>. This result was originally reported in 2003 by Daniel Goldston and Cem Yñldñrñm but was later retracted. Pintz joined the team and completed the proof in 2005 and developed the so-called GPY sieve. Later, they improved this to showing that p<sub>n+1</sub> â p<sub>n</sub> < õ(log log n)<sup>2</sup> occurs infinitely often. Further, if one assumes the ElliottâÂÂHalberstam conjecture, then one can also show that primes within 16 of each other occur infinitely often, which is nearly the twin prime conjecture.
Additionally,