János Pintz is a Hungarian mathematician working in analytic number theory. Pintz is best known for the following result that he, Daniel Goldston, and Cem Yıldırım proved in 2005: <math>\liminf_{n\to\infty}\frac{p_{n+1}-p_n}{\log p_n}=0</math> where <math>p_n\ </math> denotes the nth prime number.

PropertyValue
dbpprop:abstract
  • János Pintz is a Hungarian mathematician working in analytic number theory. Pintz is best known for the following result that he, Daniel Goldston, and Cem Yıldırım proved in 2005: <math>\liminf_{n\to\infty}\frac{p_{n+1}-p_n}{\log p_n}=0</math> where <math>p_n\ </math> denotes the nth prime number. In other words, for every c > 0, there exist infinitely many pairs of consecutive primes pn and pn+1 that are closer to each other than the average distance between consecutive primes by a factor of c, i.e. , pn+1 − pn < c log pn. This result was originally reported in 2003 by Dan Goldston and Cem Yıldırım but was later retracted. Then Janos Pintz joined the team and completed the proof in 2005. In fact, 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.
  • Pintz János magyar matematikus, az MTA tagja.
dbpprop:reference
rdfs:comment
  • János Pintz is a Hungarian mathematician working in analytic number theory. Pintz is best known for the following result that he, Daniel Goldston, and Cem Yıldırım proved in 2005: <math>\liminf_{n\to\infty}\frac{p_{n+1}-p_n}{\log p_n}=0</math> where <math>p_n\ </math> denotes the nth prime number.
  • Pintz János magyar matematikus, az MTA tagja.
rdfs:label
  • János Pintz
  • Pintz János
skos:subject
foaf:page