Erdős Problem #887 — Is there an absolute constant K such that, for every C>0, if n is sufficiently large then n has at most K divisors in (n^1/2,n^1/2+C n^1/4).
Statement
Is there an absolute constant such that, for every , if is sufficiently large then has at most divisors in .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.