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?

Workspace

Opens this exact Problem and source revision in Workbench. Nothing is cloned, uploaded, or executed.

How a contribution reaches this record

Seven steps, in four places.

  1. Read the sources and their formal declarations.

    Public
  2. Work on it, wherever you work.

    Your machine
  3. Keep an Approach and its Attempts here.

    Needs an account
  4. Attach evidence by its content root.

    Needs an account
  5. Prepare an unsigned Submission draft.

    Needs an account
  6. Sign it with your own key.

    Your machine
  7. The Repository decides.

    The Repository

Reported activity

Reported by these sources. 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