ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each k⩾2k\geqslant2, let βk\beta_k be the equal-sums exponent for logarithmic random sets, and let αk\alpha_k be the supremum of the real numbers α\alpha such that almost every nn has kk divisors in a multiplicative interval of relative width (log⁡n)−α(\log n)^{-\alpha}. Sharpness conjecture. For all k⩾2k\geqslant2, one has

αk=βk1−βk.\alpha_k=\frac{\beta_k}{1-\beta_k}.

The paper proves the inequality αk⩾βk/(1−βk)\alpha_k\geqslant\beta_k/(1-\beta_k), while the matching upper bound is left for future work.

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.