Andrew Granville's
publications in
algorithmic number theory


Carmichael numbers
with Carl Pomerance
  • Article and AMS Review
  • Two contradictory conjectures concerning Carmichael numbers
    Mathematics of Computation, vol 71 (2002) pages 873-881
    with Red Alford and Carl Pomerance
  • Article and AMS Review
  • There are infinitely many Carmichael numbers
    Annals of Mathematics, vol 140 (1994) pages 703-722
    with Red Alford and Carl Pomerance
  • Article and AMS Review
  • On the difficulty of finding reliable witnesses
    'Algorithmic Number Theory' Proceedings  (ANTS-I) (eds L.M. Adleman and M.D. Huang), Lecutres Notes in Computer Sci., 877 (1994) pages 1-16


    Factoring polynomials


  • Article and AMS Review
  • Bounding the coefficients of a divisor of a given polynomial
    Monatshefte fur Mathematik, 109 (1990) pages 271-277


    Properties of fields

    with Richard Mollin and Hugh C. Williams
  • Article and AMS Review
  • An upper bound on the least inert prime in a real quadratic field
    Canadian Journal of Mathematics, vol 52 (2000) pages 369--380
    with Gilbert Fung and Hugh C. Williams
  • Article and AMS Review
  • Computation on the first factor of the class number of cyclotomic fields
    Journal of Number Theory, vol. 42 (1992) pages 297-312


    Factoring numbers

    with Peter Pleasants
  • Article
  • Aurefeuillian factorization revisited
    Mathematics of Computation
    vol 75 (2006) pages 497--508