Skip to content

Erdős Problem #768

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

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

Define A as the positive integers n such that for EACH prime p dividing n, there is some divisor d>1 of n with d≡1 (mod p). Erdős asked whether the natural density of A through N is exp(−(c+o(1))√(log N)·loglog N) for some c>0. The exact exponential constant and even precise scale remain OPEN. The d may depend on p, but must itself divide the same n.

A small example

n=12 belongs to A: for p=2 choose d=3 (3≡1 mod2); for p=3 choose d=4 (4≡1 mod3). By contrast n=6 does not: for p=3 the divisors >1 are 2,3,6 and none is 1 mod3. A prime n=p also fails: its only divisor >1 is p, congruent 0 mod p. These are exact small membership fixtures.

What is known

The maintained source attributes to Erdős a lower bound exp(−C√(log N) loglog N) for density and an upper exp(−(1+o(1))√(log N loglog N)). The exponent in the latter is sqrt(log N * loglog N), NOT sqrt(log N)*loglog N, so the two bounds differ by a factor about sqrt(loglog N) in scale. Erdős connected |A∩[1,N]| to upper bounds on possible orders of noncyclic simple groups, but the property is not an equivalence to the classification of such groups. Full 1974 arithmetic proof uninspected.

GCL's current state

The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.

Preserved source-review qualifications: divisor congruence density sharp scale open; lower and upper exponent root placement differs. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

Implement divisor/primality finite membership tests, prove n=12 qualifies and n=6 does not, and source-check exact parentheses in both exponent bounds. Explore a restricted family (semiprimes or prime powers) for a density upper/lower lemma without claiming an asymptotic constant.

Sources and claim boundaries

Maintained Erdős #768; authenticated GCL source return. Full original primary proofs and browser readback is a protected publication verification gate. source-qualified editorial review recorded.

Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2039 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: STATEMENT_CAPTURE_REQUIRED.
  • Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider 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