Erdős Problem #203 — Composite shifts of 2–3-smooth multiples
Does there exist an integer with such that, for every pair of nonnegative integers , the number is not prime? Equivalently, does there exist such an for which
Every term is greater than , so “not prime” is equivalent to “composite.” The pair is included and requires to be composite. Erdős Problems #203
Background
This question concerns a two-exponent extension of the Sierpiński-number problem. A standard way to construct coefficients for which a family of exponential expressions is always composite is to find finitely many primes such that each exponent is covered by a congruence class on which one of those primes divides the expression. For a single power, the divisibility classes arise from the multiplicative orders of the base modulo the covering primes. The mixed family here has two independently varying exponents, so a construction for one exponent alone does not provide the required coverage. Izotov (1995) Erdős Problems #203
The classical one-base result is due to Sierpiński, who proved in 1960 that infinitely many positive odd coefficients have composite for every . The problem page attributes the present question to an Erdős–Graham reference and notes broader variants with products of powers of distinct primes. Its citation is “ErGr80, p. 27”; the separate 1980 Erdős survey is not that reference. Izotov (1995) Erdős Problems #203
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.