Consecutive integers divisible by prescribed prime powers

ID: consecutive-integers-divisible-by-prescribed-prime-powers

Let be distinct prime numbers and positive integers. There are infinitely many positive integers with for every . Indeed the moduli are pairwise coprime, so the Chinese remainder theorem solves simultaneously. Adding multiples of their product gives arbitrarily large positive solutions. This allows long runs in which every integer has a large prescribed prime power divisor, even though neighboring integers are coprime.

New to topics? Read the docs here!