ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥2k\ge 2 be an integer, let x≥1x\ge 1 be real, and let Qk(t)Q_k(t) denote the number of kk-full numbers at most tt. A number is kk-full if every exponent in its prime factorization is at least kk. Short-interval upper-bound conjecture. There exists a constant Ck≥1C_k\ge 1 such that

Qk(x+y)−Qk(x)≤Cky1/kQ_k(x+y)-Q_k(x)\le C_k y^{1/k}

uniformly for 1≤y≤x1\le y\le x. This would give a uniform bound for the number of kk-full numbers in short intervals, analogous to the bound for perfect kk-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.