Consecutive integers with no large prime factors

Abstract

Listen

Translate article

For fixed integers k and m, with k ≥m ≥ 2, there are only finitely many runs of m consecutive integers with no prime factor exceeding k. We obatin lower bounds for the last such run. Let g(k, m) be its smallest member. For 2 ≤ m ≤ 5 it is shown that g(k, m) > kc logloglogk holds for all sufficiently large k, where c is a constant depending only on m. We also obtain a number of lower bounds with explict ranges of validity. A typical result of this type g(k, 3) > k3 holds just if k ≥ 41.