Prime factors of consecutive integers

@article{Bauer2008PrimeFO,
  title={Prime factors of consecutive integers},
  author={Mark Bauer and Michael A. Bennett},
  journal={Math. Comput.},
  year={2008},
  volume={77},
  pages={2455-2459}
}
This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in the sequence of integers all of whose prime factors exceed k. This algorithm enables us to show that f(k) is not monotone, verifying a conjecture of Ecklund and Eggleton. 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

The prime factors of consecutive integers

  • D. H. Lehmer
  • Amer. Math. Monthly 72
  • 1965
Highly Influential
6 Excerpts

On gaps between numbers with a large prime factor II

  • T. N. Shorey
  • Acta Arith. 25
  • 1974
Highly Influential
2 Excerpts

A conjecture of Erdős concerning consecutive integers

  • W. R. Utz
  • Amer. Math. Monthly 68
  • 1961
Highly Influential
4 Excerpts

The difference between consecutive prime numbers

  • R. Rankin
  • J. London Math. Soc. 13
  • 1938
Highly Influential
2 Excerpts

Solving the Pell equation

  • H. C. Williams
  • Number theory for the millennium, III
  • 2000

Consecutive integers with no large prime factors

  • R. B. Eggleton, J. L. Selfridge
  • J. Austral. Math. Soc. Ser. A 22
  • 1976

Jr

  • E. F. Ecklund
  • and R. B. Eggleton. Prime factors of consecutive…
  • 1972
3 Excerpts

Prime factors of consecutive integers

  • R. B. Eggleton
  • Amer . Math . Monthly
  • 1972

Similar Papers

Loading similar papers…