Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Problem 931

../


Statement. Let k1≥k2≥3k_1\geq k_2\geq 3. Are there only finitely many $n_2\geq n_1+k_1$ such that

∏1≤i≤k1(n1+i) and ∏1≤j≤k2(n2+j)\prod_{1\leq i\leq k_1}(n_1+i)\textrm{ and }\prod_{1\leq j\leq k_2}(n_2+j)

have the same prime factors?

Formulation. The question is read, as Erdős's display (10) of 1976 reads it ("only finitely often", p. 29), and as the formal-conjectures statement states it, as asking whether, for fixed k1≥k2≥3k_1\ge k_2\ge3, only finitely many pairs (n1,n2)(n_1,n_2) with n2≥n1+k1n_2\ge n_1+k_1 occur. For a fixed n1n_1 finiteness is immediate: every term of the second block is composed of the primes dividing the first product, and Størmer's theorem leaves only finitely many pairs of consecutive such integers. The standing concerns the pairs reading.

Status. Open.

Source. erdosproblems.com/931, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #931, https://www.erdosproblems.com/931.

References.

  • [Er76d] Erdős, P., Problems and results on number theoretic properties of consecutive integers and related questions. Proceedings of the Fifth Manitoba Conference on Numerical Mathematics (Univ. Manitoba, Winnipeg, Man., 1975) (1976), 25-44.
  • [Gu04] Guy, Richard K., Unsolved problems in number theory. 3rd ed., Problem Books in Mathematics, Springer, New York (2004), xviii+437 pp.; section B35 "Products of consecutive numbers with the same prime factors", printed p. 138, which states the question for (m+1)⋯(m+k)(m+1)\cdots(m+k) and (n+1)⋯(n+l)(n+1)\cdots(n+l) with k≥l≥3k\ge l\ge3, gives the examples 2⋯102\cdots10 with 14⋅15⋅1614\cdot15\cdot16 and 48⋅49⋅5048\cdot49\cdot50 and 2⋯122\cdots12 with 98⋅99⋅10098\cdot99\cdot100, and records Erdős's conjecture that for k=l≥3k=l\ge3 this happens only finitely many times; for k>lk>l Guy states only the question. Guy cites Erdős, Amer. Math. Monthly 87 (1980), 391--392. Library home: guy_2004_unsolved_problems_number_theory.

Formalization. Statement in formal-conjectures.

Current assessment

No current assessment is recorded. The status above is imported from the dated site record. The notes below record author-recorded transfers from research folders and are not independently reviewed. This page records no current literature search or independent assessment of proof coverage.

Known Results

The SS-unit count of Lemma 3.2 of Pollack, Pomerance and Treviño (reconstruction) concerns pairs at a fixed difference, not products of blocks.

Linked library material

These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.