Given $0 < p < n$, prove there exists $n$ consecutive natural numbers such that each natural is divisible by at least $p$ distinct primes.
Is there a general proof method to prove this statement?
I brushed up my knowledge on the Chinese Remainder Theorem and Euclid's Theorem since they seem relevant, but I cannot find the necessary insight.