Also let nk denote the smallest integer n such that the numbers n+1, ..., n+k all have a prime factor exceeding k. It is shown by elementary means that, for sufficiently large k, nk > \frac 1{16}k5/2. This bounded is probably nowhere near the best possible.
Reviewer: I.Anderson
Classif.: * 11N05 Distribution of primes
11A41 Elemementary prime number theory
05A10 Combinatorial functions
Keywords: binomial coefficient; consecutive integers; distinct prime factors
Citations: Zbl.339.10006
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag