ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an integer nn with distinct prime divisors pp, define f(n)=∑p∣npapf(n)=∑_{p\mid n}p^{a_p}, where pap≤n<pap+1p^{a_p}≤n<p^{a_p+1}. Let F(n)F(n) be the maximum of ∑ibi∑_i b_i over pairwise coprime positive integers bi≤nb_i≤n whose prime divisors all divide nn, and put m(x)=max⁡n≤xf(n)m(x)=\max_{n≤x}f(n) and M(x)=max⁡n≤xF(n)M(x)=\max_{n≤x}F(n). Is it true that f(n)=o(nlog⁡log⁡n)f(n)=o(n\log\log n) and F(n)≫nlog⁡log⁡nF(n)\gg n\log\log n for almost all nn? Is m(x)∼xlog⁡x/log⁡log⁡xm(x)∼x\log x/\log\log x, and does m(x)=M(x)m(x)=M(x) for every sufficiently large xx? Estimate the number of n≤xn≤x for which f(n)=F(n)f(n)=F(n). Finally, determine the asymptotic growth of H(x)=∑n≤xf(n)/nH(x)=∑_{n≤x}f(n)/n; in particular, is H(x)≪xlog⁡log⁡log⁡log⁡xH(x)\ll x\log\log\log\log x?

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.