Daniel Goldston

Daniel Alan Goldston was born on January 4, 1954, in Oakland, California. In 1972, he matriculated to the University of California, Berkeley, where he earned his bachelor's degree and, in 1981, a Ph.D. in mathematics. His doctoral advisor at Berkeley was Russell Sherman Lehman; his dissertation was entitled "Large Differences between Consecutive Prime Numbers".[1]

After earning his doctorate, Goldston worked at the University of Minnesota Duluth and then spent the next academic year (1982–83) at the Institute for Advanced Study (IAS) in Princeton. He has worked at San Jose State University since 1983, save for stints at the IAS (1990), the University of Toronto (1994), and the Mathematical Sciences Research Institute in Berkeley (1999).

In 2009, Goldston, János Pintz, and Cem Yıldırım proved: ${\displaystyle \liminf _{n\to \infty }{\frac {p_{n+1}-p_{n}}{\log p_{n}}}=0}$

where ${\displaystyle p_{n}}$ denotes the n^th prime number. In other words, for every ${\displaystyle c>0\ }$, there exist infinitely many pairs of consecutive primes ${\displaystyle p_{n}\ }$ and ${\displaystyle p_{n+1}\ }$ which are closer to each other than the average distance between consecutive primes by a factor of ${\displaystyle c\ }$, i.e., ${\displaystyle p_{n+1}-p_{n}<c\log p_{n}\ }$.[2] This result was originally reported in 2003 by Goldston and Yıldırım but was later retracted.[3][4] Then Pintz joined the team and they completed the proof with the GPY sieve.

In 2014, Goldston won the Cole Prize, shared with Yitang Zhang and colleagues Cem Yildirim and János Pintz, for his contributions to number theory.[1] Also, Goldston was named to the 2021 class of fellows of the American Mathematical Society "for contributions to analytic number theory".[5]

• Landau's problems
• Yitang Zhang
• James Maynard (mathematician)

• Dan Goldston's Homepage