Daniel Larsen (mathematician)

Daniel Larsen
Born2003 (age 22–23)
Indiana, U.S.
EducationMassachusetts Institute of Technology (ongoing)
Known forWork on Carmichael numbers
AwardsMorgan Prize Honorable Mention (2026)

Daniel Larsen (born 2003) is an American mathematician known for proving[1] a 1994 conjecture of W. R. Alford, Andrew Granville and Carl Pomerance on the distribution of Carmichael numbers, commonly known as Bertrand's postulate for Carmichael numbers.[2] He received an Honorable Mention for the 2026 Frank and Brennie Morgan Prize for Outstanding Research in Mathematics by an Undergraduate Student for his work on Carmichael numbers.[3][4]

Childhood and education

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 an enthusiasm 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.[5]

While attending Bloomington High School South, he became the youngest accepted contributor to The New York Times crossword puzzle in February 2017[6] and ended up submitting 11 approved puzzles before his graduation from high school.[7][8] He applied to and became a finalist in the 2022 Regeneron Science Talent Search for his published research on Carmichael numbers and ultimately won 4th place in the competition,[9][5] winning $100,000 to pay for his college tuition.[10] In the fall of 2022, he began attending university at the Massachusetts Institute of Technology (MIT).[1]

Career and research

During his teenage years, after watching a documentary about Yitang Zhang, Larsen became interested in number theory and the twin prime conjecture in particular. The subsequent strengthening of Zhang's method by James Maynard and Terence Tao not long after rekindled his desire to better understand the math involved. He found it too complex at that time, and it wasn't until after reading a paper in February 2021 on Carmichael numbers that he gained insight on the fundamentals of the problem.[1] In November of the same year, Larsen published a paper titled "Bertrand's Postulate for Carmichael Numbers"[11] on the open access repository arXiv 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 and sufficiently large in terms of , there will always be at least

Carmichael numbers between and

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.[5][12] An earlier paper of his on self-similar sequences appeared in The Fibonacci Quarterly.[13]

As an undergraduate at MIT, Larsen continued working on Carmichael numbers. In an April 2025 preprint, "Carmichael Numbers in All Possible Arithmetic Progressions," he proved that every arithmetic progression either contains infinitely many Carmichael numbers or none at all, and gave a simple criterion for distinguishing the two cases. As a consequence, he established that , resolving another question raised by Alford, Granville, and Pomerance in their 1994 paper.[14] Subsequent work with Thomas Wright established the existence of Carmichael numbers with any specified number of prime factors,[15] and a 2026 paper with his father, Michael J. Larsen, addressed robust additive bases.[16]

In November 2025, Larsen received an Honorable Mention for the 2026 Frank and Brennie Morgan Prize for Outstanding Research in Mathematics by an Undergraduate Student, awarded jointly by the American Mathematical Society, the Mathematical Association of America, and the Society for Industrial and Applied Mathematics. The prize citation noted his "substantial contributions to long-standing conjectures in analytic number theory about Carmichael numbers, which show a high level of creativity and mastery of many different tools and approaches in number theory."[3][4]

References

  1. 1 2 3 4 5 Cepelewicz, Jordana (October 13, 2022). "Teenager Solves Stubborn Riddle About Prime Number Look-Alikes". Quanta Magazine. Retrieved October 15, 2022.
  2. ↑ W. R. Alford; Andrew Granville; Carl Pomerance (1994). "There are Infinitely Many Carmichael Numbers" (PDF). Annals of Mathematics. 140 (3): 703–722. doi:10.2307/2118576. JSTOR 2118576. Archived (PDF) from the original on March 4, 2005.
  3. 1 2 "2026 Frank and Brennie Morgan Prize for Outstanding Research in Mathematics by an Undergraduate Student". American Mathematical Society. Retrieved May 16, 2026.
  4. 1 2 Yefremova, Anastasia (November 25, 2025). "Two Harvard Math Graduates Honored for Outstanding Research". Harvard University Department of Mathematics. Retrieved May 16, 2026.
  5. 1 2 3 Wright, Lili (August 28, 2022). "The Ups And Downs Of Daniel Larsen". Indianapolis Monthly. Retrieved October 15, 2022.
  6. ↑ Howellthe, Brittani (February 20, 2017). "Indiana 7th grader becomes crossword puzzle creator". Associated Press. Retrieved September 4, 2023.
  7. ↑ Shortz, Will (February 14, 2017). "The Youngest Crossword Constructor in New York Times History". The New York Times. Retrieved October 15, 2022.
  8. ↑ Amien, Deb (March 3, 2022). "60 Seconds With Daniel Larsen". The New York Times. Retrieved October 15, 2022.
  9. ↑ Stephenson, Christine (March 23, 2022). "How an Indiana high school student learned about himself through a mathematical discovery". The Herald-Times. Retrieved October 15, 2022.
  10. ↑ "High School South student Daniel Larsen wins 100k for math project". Massachusetts News. March 23, 2022. Retrieved December 18, 2022.
  11. ↑ Larsen, Daniel (November 5, 2021). "Bertrand's Postulate for Carmichael Numbers". arXiv:2111.06963 [math.NT].
  12. ↑ Larsen, Daniel (July 20, 2022). "Bertrand's Postulate for Carmichael Numbers". International Mathematics Research Notices. 2023 (15): 13072–13098. arXiv:2111.06963. doi:10.1093/imrn/rnac203. ISSN 1073-7928.
  13. ↑ Larsen, Daniel (2020). "Focusing Sequences and Self-Similarity". The Fibonacci Quarterly. 58 (3): 231–240. doi:10.1080/00150517.2020.12427586.
  14. ↑ Larsen, Daniel (April 12, 2025). "Carmichael Numbers in All Possible Arithmetic Progressions". arXiv:2504.09056 [math.NT].
  15. ↑ Larsen, Daniel; Wright, Thomas (October 18, 2025). "Carmichael Numbers with a Specified Number of Prime Factors". arXiv:2510.16632 [math.NT].
  16. ↑ Larsen, Daniel; Larsen, Michael (2026). "Robust additive bases without minimal subbases". arXiv:2601.18507 [math.NT].