Erdős problem 768 · problems.science

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})$ .

Workspace

Continue locally Open source Sign in to contribute

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Source#768
→
ResultNone
→
Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

AI collaborating with humans
Erdős AI contributions wiki · 22 Jun, 2026
Machine
GPT
People
Eric Li
Open the source record
argument
VibeMathed
Machine
ChatGPT + Aristotle
People
Eric Li
Reported outcome
candidate
Open the source record
argument
VibeMathed
Machine
ChatGPT, Aristotle
People
Eric Li
Reported outcome
resolved
Open the source record

Reported activity

Search problems.science