Let p1,p2,...,pk be k different primes. We consider all positive integers that use only these primes (not necessarily all) in their prime factorization, and arrange those numbers in increasing order, forming an infinite sequence: a1<a2<...<an<...
Prove that, for every number c, there exists n such that an+1−an>c. inequalitiesnumber theory