Erdős problem 1188
Estimate the number of minimal distinct covering systems whose moduli all lie in . The candidate proof gives , i.e. .
Sources
Retained excerpts/
VibeMathed
Retained source excerpt
Estimate the number $F(x)$ of minimal distinct covering systems whose moduli all lie in $[1, x]$. The candidate proof gives $\log\log F(x)/\log x \to 1$, i.e. $F(x) = \exp(x^{1+o(1)})$.
Open exact source location