Open main menu

Andrew James Granville (born 7 September 1962) is a British mathematician, working in the field of number theory.

Andrew Granville
Born7 September 1962 (1962-09-07) (age 56)
NationalityBritish
Alma materQueen's University
AwardsChauvenet Prize (2008)
Scientific career
FieldsMathematics
InstitutionsUniversité de Montréal
University of Georgia
Doctoral advisorPaulo Ribenboim
Doctoral studentsErnest S. Croot III
Websitedms.umontreal.ca/~andrew/

He has been a faculty member at the Université de Montréal since 2002. Before moving to Montreal he was a mathematics professor at the University of Georgia (UGA) from 1991 until 2002. He was a section speaker in the 1994 International Congress of Mathematicians together with Carl Pomerance from UGA.

Granville received his Bachelor of Arts (Honours) (1983) and his Certificate of Advanced Studies (Distinction) (1984) from Trinity College, Cambridge University. He received his Ph.D. from Queen's University in 1987[1] and was inducted into the Royal Society of Canada in 2006.

Granville's work is mainly in number theory, in particular analytic number theory. Along with Carl Pomerance and W. R. (Red) Alford he proved the infinitude of Carmichael numbers in 1994.[2] This proof was based on a conjecture given by Paul Erdős.

Granville won a Lester R. Ford Award in 2007[3] and again in 2009.[4] In 2008, he won the Chauvenet Prize from the Mathematical Association of America for his paper "It is easy to determine whether a given integer is prime".[5][6] In 2012 he became a fellow of the American Mathematical Society.[7]

ReferencesEdit

  1. ^ Andrew Granville at the Mathematics Genealogy Project
  2. ^ W. R. Alford; Andrew Granville; Carl Pomerance (1994). "There are infinitely many Carmichael numbers" (PDF). Annals of Mathematics. 139 (3): 703–722. doi:10.2307/2118576. MR 1283874.
  3. ^ Andrew Granville; Greg Martin (2006). "Prime Number Races". Amer. Math. Monthly. 113: 1–33. doi:10.2307/27641834.
  4. ^ Andrew Granville (2008). "Prime Number Patterns". Amer. Math. Monthly. 115 (4): 279–296. JSTOR 27642472.
  5. ^ Andrew Granville (2005). "It is easy to determine whether a given integer is prime" (PDF). Bulletin of the American Mathematical Society. 42 (01): 3–38. doi:10.1090/S0273-0979-04-01037-7. MR 2115065.
  6. ^ MAA Chauvenet Prize page
  7. ^ List of Fellows of the American Mathematical Society, retrieved 2013-01-19.

External linksEdit