Endre Szemerédi
Hungary in the mid-twentieth century was practically an assembly line for Jewish mathematical geniuses. You had Paul Erdős wandering the earth with two suitcases, John von Neumann inventing modern computing before lunch, and then you had Endre Szemerédi, who decided to get into the game late just to show everyone how it was done. Szemerédi originally studied medicine, dropped out because he couldn't stand the sight of blood, worked in a machine factory, and finally gave mathematics a shot in his twenties.
It turned out he was rather good at it. In 1975, he solved a legendary conjecture proposed by Erdős and Paul Turán, proving that any dense subset of integers contains arbitrarily long arithmetic progressions. Now known as Szemerédi's Theorem, the proof was so famously intricate, combinatorial, and brutal that it gave birth to the Szemerédi Regularity Lemma, which revolutionized graph theory. Erdős had offered a thousand dollars for the solution—an astronomical bounty by Erdős standards—and Szemerédi gladly collected.
For decades of groundbreaking brilliance, Szemerédi scooped up the Abel Prize in 2012, mathematics' equivalent of the Nobel. Despite spending much of his career splitting time between Rutgers University in New Jersey and the Alfréd Rényi Institute in Budapest, he remained characteristically modest, often joking that he wasn't a real mathematician because he just played with finite sets of dots and lines.
Szemerédi was born to a Jewish family in Budapest in 1940, surviving the horrors of World War II as an infant before blossoming into one of the sharpest combinatorial minds in human history. He might not make headlines like movie stars or politicians, but when it comes to Jewish mathematicians solving problems that baffled generations of geniuses, Szemerédi is the real deal.




