Skip to content

Erdős Problem #366

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: verifiable (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

Problem 366 asks whether two consecutive positive integers can have an unusually strong divisibility property in a specified order. A positive integer is called full of order \(k\) when every prime appearing in its factorization appears to exponent at least \(k\). Thus the question is whether there is a positive \(n\) such that \(n\) has order \(2\) and \(n+1\) has order \(3\). In the website's original wording, this is written as: if a prime \(p\) divides \(n\), then \(p^2\) divides \(n\), and if \(p\) divides \(n+1\), then \(p^3\) divides \(n+1\).

The word “prime” matters. Read literally for every divisor \(p\), the sentence would describe a different property; the conventional and formalized reading is for prime divisors. The quantifier is existential: one witness settles the question positively. A proof that no witness exists would settle it negatively, but the current record supplies no such theorem or finite cutoff. “Verifiable” is therefore a catalogue status for an existential problem, not a claim that a witness, decision procedure, or proof is already available.

A small example

The direction of the two conditions is easy to confuse. Exact arithmetic verifies the documented reversed pair

\[ 12167=23^3,\qquad 12168=2^3\cdot3^2\cdot13^2. \]

Every prime exponent in the first factorization is at least \(3\), so \(12167\) has both order \(3\) and order \(2\). The exponents in the second factorization are \(3,2,2\), so \(12168\) has order \(2\) but not order \(3\). Consequently this is a genuine reversed-order pair, not a solution to Problem 366. The smaller pair \(8=2^3\) and \(9=3^2\) has the same reversed orientation.

These identities were checked with exact integer multiplication and prime factorization; no floating-point estimate is involved. They illustrate the definitions and why an example from the opposite order cannot be promoted to an answer. They establish nothing about whether an integer of order \(2\) can be followed by one of order \(3\).

What is known

The maintained Erdős Problems entry, read on 2026-10-13, calls the problem “VERIFIABLE Open, but could be proved with a finite example.” It reports no known positive solution and says that, using OEIS A060355, there are no other relevant examples below \(10^{22}\). The latter is a reported finite-search boundary: because an integer of order \(3\) is automatically of order \(2\), any solution would occur among consecutive powerful pairs. It is not a proof that no larger pair exists.

The primary historical source is P. Erdős, “Problems and results on number theoretic properties of consecutive integers and related questions,” Proceedings of the Fifth Manitoba Conference on Numerical Mathematics (1976), pp. 25–44, especially p. 31. In the readable scan, Erdős defines the relevant sequence of powerful numbers, records Mahler's observation that Pell solutions to \(x^2-8y^2=1\) give infinitely many consecutive powerful numbers, and discusses further questions about gaps and consecutive powerful numbers. The source page does not transparently state the modern mixed order two/order three sentence in the same notation. The live entry also cites Erdős and Graham (1980, p. 68), so the exact historical attribution should remain qualified rather than reconstructed from memory.

The live discussion contains an ABC-conditional finiteness argument and a later unverified claim of an enormous explicit bound. Those are reports attached to the website, not an externally certified theorem in this audit. An ABC assumption would be a conditional result, not a proof in the ordinary unconditional setting; neither report decides the existence question.

GCL's current state

The frozen catalogue record is teorth/erdosproblems commit 536408716724a2402bdfa7c1d764bf83d64a8c89, entry number: "366", Git blob 4e60263a80af6207aca494d2e1388e44fa372889. It records verifiable, last updated 2025-08-31, notes “ambiguous statement,” and separates formalized: yes from formal_status: unformalized. The Programme registry places the item in OUTSIDE_STRICT_OPEN_TRIAGE; that is a routing and campaign-selection boundary, not a mathematical conclusion. V2 ledger state, not this article, decides accepted coverage.

The pinned FormalConjectures file is at commit 85f863718beeec7b58a3a1926ee92e3472bc2020, blob 30b8a61bd3df8ab455373af8164b95a4ac6f5154. Its main declaration uses natural numbers, requires positive \(n\), and expresses the existential with Nat.Full 2 n and Nat.Full 3 (n+1). The pinned definition of Nat.Full means every member of n.primeFactors has its corresponding power of exponent \(k\) dividing \(n\); the declaration itself ends in sorry. It is a statement interface, not a proof, replay, or semantic certification.

What remains

The next bounded task should first produce a source-normalization note comparing the exact page-31 terminology, the Erdős–Graham reference, the live sentence, and Nat.Full. It should explicitly decide whether the catalogue wording is the adopted interpretation or whether a historical variant must be recorded alongside it. It should then reproduce a finite search under that interpretation, with the search range, factorization method, and machine-readable candidate list fixed in advance. Acceptance would require exact agreement with the stated quantifiers and an independently inspectable certificate for every surviving candidate; falsification would be either a genuine witness or a source-level contradiction that changes the normalized statement.

The task must stop after the bounded range and source comparison, or immediately on a witness, semantic mismatch, or missing primary page. It must not turn the reported ABC observation into an unconditional theorem, and it must not treat a Lean declaration containing sorry as a solved result. A larger search, an ABC-conditional bound, or proof work would require a separately authorized research package.

Sources and claim boundaries

The central source links are the original GCL issue #1636, the live Problem 366 page, the 1976 Erdős scan, and Golomb's primary paper, “Powerful Numbers,” American Mathematical Monthly 77 (1970), 848–852. The downloaded Erdős PDF had SHA-256 66c81fe32d0540e2c2b9a97fe731feec280cb163e2911a10043efa548e4af7d5; this identifies the document inspected here, not a claim that it settles Problem 366.

Established here are the normalized existential statement, the exact finite factorization example, the dated catalogue/formal snapshots, and the distinction between statement capture and proof. The finite-search report, ABC discussion, and website proof claim remain external reports requiring their own verification. GCL supplies no mathematical certification in this article. The original SOURCE RESULT/1 citation is authenticated original RESULT/1; no future issue-comment URL is fabricated here.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1636 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • 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