| Hendrik Lenstra | |
| Birth Date: | 16 April 1949 |
| Birth Place: | Zaandam, Netherlands |
| Nationality: | Dutch |
| Fields: | Mathematics |
| Workplaces: | University of California, Berkeley University of Leiden |
| Alma Mater: | University of Amsterdam |
| Doctoral Advisor: | Frans Oort |
| Thesis Title: | Euclidische getallenlichamen |
| Thesis Year: | 1977 |
| Doctoral Students: | |
| Known For: | Lenstra elliptic-curve factorization Lenstra–Lenstra–Lovász lattice basis reduction algorithm Lenstra–Pomerance–Wagstaff conjecture APR-CL primarily test |
| Awards: |
|
Hendrik Willem Lenstra Jr. (born 16 April 1949, Zaandam) is a Dutch mathematician.
Lenstra received his doctorate from the University of Amsterdam in 1977 and became a professor there in 1978. In 1987, he was appointed to the faculty of the University of California, Berkeley; starting in 1998, he divided his time between Berkeley and the University of Leiden, until 2003, when he retired from Berkeley to take a full-time position at Leiden.[1]
Three of his brothers, Arjen Lenstra, Andries Lenstra, and Jan Karel Lenstra, are also mathematicians. Jan Karel Lenstra is the former director of the Netherlands Centrum Wiskunde & Informatica (CWI). Hendrik Lenstra was the Chairman of the Program Committee of the International Congress of Mathematicians in 2010.[2]
Lenstra has worked principally in computational number theory. He is well known for:
In 1984, Lenstra became a member of the Royal Netherlands Academy of Arts and Sciences.[6] He won the Fulkerson Prize in 1985 for his research using the geometry of numbers to solve integer programs with few variables in time polynomial in the number of constraints.[7] He was awarded the Spinoza Prize in 1998,[8] and on 24 April 2009 he was made a Knight of the Order of the Netherlands Lion. In 2009, he was awarded a Gauss Lecture by the German Mathematical Society. In 2012, he became a fellow of the American Mathematical Society.[9]