Erdős–Rosenfeld conjecture on divisors near the square root
Statement
Let be a positive integer, and let be a real number. Consider the divisors of in the interval
Erdős–Rosenfeld conjecture. There is an absolute constant such that, for every , the number of such divisors is at most whenever .
The conjecture asks whether every positive integer has only boundedly many divisors in a short interval around its square root. The source reports results for perfect squares and almost squares, but does not state that the conjecture is resolved in general.
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.