Erdos Problem #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})$.
Exact FrontierDelta
Scope and record
Occurred: Jun 23, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-co-developed. Imported under CC BY 4.0.
Canonical aliases: Erdos Problem #768 · Erdos 768 · Problem 768
Confidence: Not scored
Registry verification: unreviewed · preprint · resolved
Attribution
VibeMathed
registry · event recorded by
Eric Li
human · human collaborator
ChatGPT
model · ai model contributor · OpenAI / Harmonic
Aristotle
model · ai model contributor · OpenAI / Harmonic
Lineage and corrections
This event attributed to Eric Li
This event attributed to Aristotle
This event attributed to ChatGPT