On strings of consecutive integers with no large prime factors

Abstract

AbstractWe investigate conditions which ensure that systems of binomial polynomials with integer coefficients are simultaneously free of large prime factors. In particular, for each positive number ε, we show that there are infinitely many strings of consecutive integers of size about n, free of prime factors exceeding nε, with the length of the strings tending to infinity with speed log log log log n.