Daniel Larsen (mathematician)

Daniel Larsen (born 2003) is an American mathematician known for proving

Larsen was born in 2003 to Indiana University Bloomington mathematics professors Michael J. Larsen and Ayelet Lindenstrauss (sister of Elon Lindenstrauss), and grew up in Bloomington, Indiana. He had a strong interest in mathematics as a child, inspired by the mathematician background of both his parents.^[1] His father hosted a math circle when he was younger that taught math on the weekend to kids in the neighborhood and Larsen attended despite being only four years old. He also had a strong interest in other projects, learning violin at age 5 and piano at age 6, along with practicing solving larger configurations of Rubik's Cubes and designing his own coin-sorting robot from Lego. He competed in the Scripps National Spelling Bee twice while in middle school, though he never made it to the final round.^[3]

While attending

that made a more consolidated proof of Maynard and Tao's postulate but involving Carmichael numbers into the twin primes conjecture and attempting to shorten the distance between the numbers per Bertrand's postulate. He concretely showed that for any ${\displaystyle {\displaystyle \delta >0}}$ and sufficiently large ${\displaystyle {\displaystyle x}}$ in terms of ${\displaystyle {\displaystyle \delta }}$, there will always be at least ${\displaystyle {\displaystyle \exp {\left({\frac {\log {x}}{(\log \log {x})^{2+\delta }}}\right)}}}$ Carmichael numbers between ${\displaystyle {\displaystyle x}}$ and ${\displaystyle {\displaystyle x+{\frac {x}{(\log {x})^{\frac {1}{2+\delta }}}}.}}$

He then emailed a copy of the paper to mathematician Andrew Granville and others involved in number theory research.^[1] The paper was later published in the journal International Mathematics Research Notices.^[3][10]

References