We 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

,
with the length of the strings tending to
infinity with speed

.