Skip to content

Erdős Problem #240

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: number theory, primes.

Read this status correctly

The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.

The question in plain language

Can one choose an infinite set of primes \(P\) so that, when the positive integers having no prime factors outside \(P\) are listed in increasing order,

\[ 1=a_1<a_2<a_3<\cdots, \]

their consecutive gaps tend to infinity?

\[ a_{j+1}-a_j\longrightarrow\infty. \]

The integers \(a_j\) are often called \(P\) smooth numbers. The prime set \(P\) must be infinite; choosing finitely many permitted primes makes the gaps large for easier reasons.

A small example

For a finite prime set \(P=\{2\}\), the sequence is \(1,2,4,8,16,\ldots\), and the differences grow without bound. This demonstrates the phenomenon but does not answer the question because \(P\) is finite.

When \(P\) is infinite, it contains infinitely many individual prime numbers, which themselves are members of the smooth sequence. The challenge is to choose \(P\) sparse enough that these extra numbers do not create infinitely many bounded gaps.

What is known

PROVED. Tijdeman (1973) showed that, for each fixed \(\varepsilon>0\), one can choose an infinite set of primes \(P\) such that the associated sequence satisfies a strong estimate of the form

\[ a_{j+1}-a_j\gg_\varepsilon a_j^{1-\varepsilon}. \]

The prime set and implicit constants may depend on the chosen exponent. The maintained source does not assert that one single prime set satisfies this bound for all exponents simultaneously. This is much stronger than simply forcing divergence of the gaps.

For a finite \(P\), classical results of Pólya and Tijdeman already gave quantitative gap information; the theorem for infinite prime sets is the substantial advance. The maintained Erdős #240 attributes the original question to Wintner, communicated to Erdős, and the definitive positive answer to Tijdeman.

GCL's current state

Pinned and maintained status: PROVED. Original source issue #1509. The historical result is source-attributed and its order of quantifiers is preserved. The original infinite-set construction and Diophantine estimates were not independently reconstructed.

The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.

What remains

A bounded task enumerates smooth numbers for finite sample prime sets and verifies their gaps and multiplicative closure. A proof-level successor must audit the exact infinite \(P\) in Tijdeman's source and verify the precise ordering: for each fixed positive \(\varepsilon\), an infinite suitable set \(P\) may be chosen. Acceptance: finite examples are never called infinite-prime-set constructions.

Sources and claim boundaries

No new sparse-prime construction, independent full Tijdeman proof or editorial admission is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1509 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction