Short-interval upper-bound conjecture for k-full numbers
Statement
Let be an integer, let be real, and let denote the number of -full numbers at most . A number is -full if every exponent in its prime factorization is at least . Short-interval upper-bound conjecture. There exists a constant such that
uniformly for . This would give a uniform bound for the number of -full numbers in short intervals, analogous to the bound for perfect -th powers; its status is not resolved in the supplied text.
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.