ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let N2e(x)N_{2^e}(x) denote the number of integers n≤xn\leq x for which S(n)=2eS(n)=2^e, and let rω1(e)r_{\omega_1}(e) be the parameter used in the paper to state the preceding bounds. Suppose that rω1(e)≥1r_{\omega_1}(e)\geq 1. The order-of-growth conjecture. As x→∞x\to\infty,

xlog⁡x(log⁡log⁡x)rω1(e)−1≪N2e(x)≪xlog⁡x(log⁡log⁡x)rω1(e)−1.\frac{x}{\log x}(\log\log x)^{r_{\omega_1}(e)-1}\ll N_{2^e}(x)\ll \frac{x}{\log x}(\log\log x)^{r_{\omega_1}(e)-1}.

The conjecture asserts matching upper and lower orders for these counting functions, sharpening the preceding theorem's bounds. The paper gives no resolution of this assertion.

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.