Skip to content

Erdős problem 931

Let k1≥k2≥3k_1 \geq k_2 \geq 3. Are there only finitely many n2≥n1+k1n_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)\ \text{and}\ \prod_{1\leq j\leq k_2} (n_2 + j) have the same prime factors?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/931.lean

Formal Conjectures

FormalConjectures/ErdosProblems/931.leanErdos931.erdos_9317 linesExact file
sorry ↔  ∀ (k₁ k₂ : ℕ),    k₂ ≥ 3 →      k₂ ≤ k₁ →        {(n₁, n₂) |            n₁ + k₁ ≤ n₂ ∧              (∏ i ∈ Finset.Icc 1 k₁, (n₁ + i)).primeFactors = (∏ j ∈ Finset.Icc 1 k₂, (n₂ + j)).primeFactors}.Finite
OpenStatement only, no proof

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

  • AI collaborating with humans

    Erdős AI contributions wiki · 12 Mar-8 Jun, 2026

    Machine
    Claude, GPT-5.4
    People
    Adenwalla, Malek Zribi
    Open the source record

Continue

Start a contributionBrowse the source filesOpen the collection entry

Search problems.science

Find a Problem, Result, source, or page