Skip to content

Problem

erdos:768

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

Declared status
open
Formalization
not formalized
OEIS
A001034 · A352287

Matching claims

0
No direct claims
This problem has no directly related claim record.

Search problems.science

Find a Problem, Result, source, or page