Skip to content

Erdős Problem #137

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

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

A positive integer is powerful when every prime dividing it occurs with exponent at least two. Erdős and Selfridge asked: for any integer \(k\ge3\), can a product of \(k\) consecutive positive integers ever be powerful?

\[ P(n,k)=(n+1)(n+2)\cdots(n+k),\qquad n\ge0. \]

An affirmative instance would have \(v_p(P(n,k))\ge2\) for every prime \(p\mid P(n,k)\). The conjecture is that no such instance exists. A perfect power, \(a^m\) with \(m\ge2\), is always powerful when \(a>1\), but a powerful integer need not be a perfect power.

A small example

The integer \(72=2^3\cdot3^2\) is powerful but not a square or cube. It also equals \(8\cdot9\), illustrating that two consecutive integers can have a powerful product. The product \(2\cdot3\cdot4=24=2^3\cdot3\) is not powerful because the prime \(3\) occurs only once. This example is not a proof for all lengths or starting values.

What is known

OPEN. Erdős and Selfridge proved in Illinois Journal of Mathematics 19 (1975), 292–301, that the product of two or more consecutive positive integers is never a nontrivial perfect power. That theorem is weaker than excluding all powerful products. The maintained Erdős #137 also records a stronger, separate question about how many primes occur to exponent exactly one in a longer product. Neither result is promoted to a proof of the stated powerful-number conjecture.

GCL's current state

Pinned status OPEN, original issue #1406. The frozen Formal Conjectures 137 file explicitly separates Powerful from the perfect-power theorem, and both declarations have proof holes. This is statement evidence, not formal certification.

The original source assignment has an authenticated RESULT/1 report. This is unadjudicated source evidence, not a proof certificate or accepted article.

What remains

Factor \(P(n,k)\) exactly for \(1\le n\le200\) and \(3\le k\le12\), recording one witness prime with valuation one in every tested case or a finite counterexample. Acceptance: verify the powerful predicate by exact prime valuations, reject incorrect inferences from the perfect-power test, and report the finite tested domain. A finite search cannot establish the universal conjecture.

Sources and claim boundaries

No resolution of the powerful-product conjecture or independent verification of the 1975 proof is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1406 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: PROTECTED_READY_BACKLOG.
  • Formal-statement coverage: A provider statement was included in the pinned 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