# Subsets of $\mathbb N$ with a finite number of prime factors

We call a subset $A = \{a_1, a_2, a_3, \dots\}$ of $\mathbb N$ with $a_1 < a_2 < \dots$ transparent if $a_{k+1} - a_k$ goes to $\infty$ as $k \rightarrow \infty$. Is the following true? For every finite set $P$ of prime numbers, the set $A_P := \{p_1 \cdots p_s : p_i \in P\}$ is transparent.

-
How can the limit approach infinity if $P$ is finite? –  J.C. Ottem Apr 9 '11 at 10:12
@J.C. Ottem: primes can appear more than once in the product. @Jens Reinhold: yes, it is true. Your set $A_P$ is a subset of the set of $(\max P)$-smooth numbers, which thin out. –  felix Apr 9 '11 at 10:15
(If this would not be true, factoring large integers would be much easier...) –  felix Apr 9 '11 at 10:16
@Felix: the (max P)-smooth numbers form a very thin set, yes, but that does not preclude the possibility that it also contains pairs of consecutive integers infinitely often. Thus "thin out" is not a proof, indeed it is a restatement of the problem. –  Greg Martin Apr 12 '11 at 22:03
by the way, "friable" is a better term than "smooth" in this context, despite the latter's head start in the literature –  Greg Martin Apr 12 '11 at 22:04

Proving that $a_{k+1}-a_k\to \infty$ reduces to proving that $$a_{k+1}-a_k=n$$ has finitely many solutions for every $n$. If you let $S$ be the set of prime divisors of $n$ union $P$, then this follows from the S-unit theorem.