ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥1k\ge 1 and A≥0A\ge 0 be fixed integers, let fA(t):=1t<1(1−t)Af_A(t):=\mathbf{1}_{t<1}(1-t)^A, and define MfA(n;R):=∑d∣nμ(d)fA ⁣(log⁡dlog⁡R).M_{f_A}(n;R):=\sum_{d\mid n}\mu(d)f_A\!\left(\frac{\log d}{\log R}\right). Then there is a constant ck,A>0c_{k,A}>0 such that, for x≥R2klog⁡Rx\ge R^{2k}\log R, 1x∑n≤xMfA(n;R)2k=ck,A(log⁡R)Ek,A+O ⁣((log⁡R)Ek,A−1),\frac1x\sum_{n\le x}M_{f_A}(n;R)^{2k}=c_{k,A}(\log R)^{E_{k,A}}+O\!\left((\log R)^{E_{k,A}-1}\right), where Ek,A:=max⁡{(2kk)−2k(A+1),−1}.E_{k,A}:=\max\left\{\binom{2k}{k}-2k(A+1),-1\right\}. In particular, Ek=Ek,0=(2kk)−2kE_k=E_{k,0}=\binom{2k}{k}-2k. Additionally, there is a constant ck′>0c'_k>0 such that, for R2k≤xR^{2k}\le x, 1x∑n≤x(∑R/2<d≤Rd∣nμ(d))2k=ck′(log⁡R)(2kk)−2k+O ⁣((log⁡R)(2kk)−2k−1).\frac1x\sum_{n\le x}\left(\sum_{R/2<d\le R\atop d\mid n}\mu(d)\right)^{2k}=c'_k(\log R)^{\binom{2k}{k}-2k}+O\!\left((\log R)^{\binom{2k}{k}-2k-1}\right). All implied constants depend at most on kk and AA.

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.