Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 

 

Fifteen consecutive integers with exactly four prime factors


Author: Tony Forbes
Journal: Math. Comp. 71 (2002), 449-452
MSC (2000): Primary 11A51
Published electronically: May 11, 2001
MathSciNet review: 1863014
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract:

We describe a successful search for a sequence of fifteen consecutive integers, each the product of exactly four prime factors. Fifteen is best possible.


References [Enhancements On Off] (What's this?)

  • 1. L. E. Dickson, A new extension of Dirichlet's theorem on prime numbers, Messenger of Mathematics 33 (1904), 155-161.
  • 2. Richard K. Guy, Unsolved problems in number theory, 2nd ed., Problem Books in Mathematics, Springer-Verlag, New York, 1994. Unsolved Problems in Intuitive Mathematics, I. MR 1299330
  • 3. D. R. Heath-Brown, The divisor function at consecutive integers, Mathematika 31 (1984), no. 1, 141–149. MR 762186, 10.1112/S0025579300010743
  • 4. C. Spiro, Thesis, Urbana, 1981.

Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2000): 11A51

Retrieve articles in all journals with MSC (2000): 11A51


Additional Information

Tony Forbes
Affiliation: 22 St. Albans Road, Kingston upon Thames, Surrey, KT2 5HQ, England
Email: tonyforbes@ltkz.demon.co.uk

DOI: https://doi.org/10.1090/S0025-5718-01-01321-7
Keywords: Prime factors
Received by editor(s): March 14, 2000
Published electronically: May 11, 2001
Article copyright: © Copyright 2001 American Mathematical Society