Erdos Problem #768

Erdős problem #768 · erdosproblems.com/768

Let $A(x)$ count $n \le x$ such that every prime $p \mid n$ has a divisor $d > 1$ of $n$ with $d \equiv 1 \pmod p$ . Erdos asked whether $A(x)/x = \exp(-(c+o(1))\sqrt{\log x}\log\log x)$ . It does, with $c = 1/(2\sqrt{\log 2})$ .

Result: Proved
Status: Resolved
AI contribution: AI co-developed
Method: Argument
Field: Number theory
Posed by: Paul Erdos
Year posed: —
Years open: —
Solved: 2026-06-23
Model: ChatGPT, Aristotle
Vendor: OpenAI / Harmonic
Collaborators: Eric Li
Verification: Unreviewed
Publication: Preprint
Significance: 10 / 100
Disclosed cost: —
Wikipedia: No dedicated article

What the AI did

The declaration says large language models, primarily ChatGPT, were used extensively throughout the research, with the author originating the ideas, and that the accompanying Lean formalization was produced with Harmonic's Aristotle under the author's direction and audit. The author also notes rejecting flawed model suggestions along the way.

Verification

A Lean formalization produced with Aristotle accompanies the paper; we have not compiled it. arXiv preprint, not peer-reviewed.

Source

arXiv:2606.24872 - A Resolution of Erdos Problem 768: the Sylow Divisor Condition

Erdos Problem #768

What the AI did

Verification

Source

Discussion