János Pintz

János Pintz (born 20 December 1950 in Budapest)[1] 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.

The native form of this personal name is Pintz János. This article uses Western name order when mentioning individuals.

Mathematical results

Pintz is best known for proving in 2005 (with Daniel Goldston and Cem Yıldırım)[2] that

where denotes the nth prime number. In other words, for every ε > 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 ε, i.e., pn+1 − pn < ε log pn. This result was originally reported in 2003 by Daniel Goldston and Cem Yıldırım but was later retracted.[3][4] Pintz joined the team and completed the proof in 2005. Later they improved this to showing that pn+1 − pn < ε√log n(log log n)2 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,

  • With János Komlós and Endre Szemerédi he disproved the Heilbronn conjecture.[5]
  • With Iwaniec he proved that for sufficiently large n there is a prime between n and n + n23/42.
  • Pintz gave an effective upper bound for the first number for which the Mertens conjecture fails.
  • He gave an O(x2/3) upper bound for the number of those numbers that are less than x and not the sum of two primes.
  • With Imre Z. Ruzsa he improved a result of Linnik by showing that every sufficiently large even number is the sum of two primes and at most 8 powers of 2.
  • Goldston, S. W. Graham, Pintz, and Yıldırım proved that the difference between numbers which are products of exactly 2 primes is infinitely often at most 6.[6]
gollark: How much of my random traffic are these responsible for?
gollark: Wait a minute, some of these strings look like the random PHP-exploity stuff in my webserver logs.
gollark: Are routers *really* this insecure?!
gollark: Huh, if my guess based on just looking at what's in the code is right this makes it fire exploity HTTP requests at *other* devices, too.
gollark: How much of this is just random strings to mildly annoy people?

See also

References
  1. Peter Hermann, Antal Pasztor: Magyar és nemzetközi ki kicsoda, 1994
  2. Goldston, D. A.; Pintz, J.; Yildirim, C. Y. (2005). "Primes in Tuples I". arXiv:math/0508185.
  3. http://aimath.org/primegaps/
  4. "Archived copy". Archived from the original on 2009-02-20. Retrieved 2009-03-31.CS1 maint: archived copy as title (link)
  5. Komlós, J.; Pintz, J.; Szemerédi, E. (1982), "A lower bound for Heilbronn's problem", Journal of the London Mathematical Society, 25 (1): 13–24, CiteSeerX 10.1.1.123.8344, doi:10.1112/jlms/s2-25.1.13.
  6. D. Goldston, S. W. Graham, J. Pintz, C. Yıldırım: Small gaps between products of two primes, Proc. Lond. Math. Soc., 98(2007) 741–774.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.