The average order of an arithmetic function

Let \(F(n)\) denote the number of all prime divisors of \(n\), distinct or not. The author proves that \[ \sum_{_{\substack{ n\leq x\\ 2\nmid n}}} 2^{F(n)}= c_2x\log x-c_5 x+O(x^\varepsilon), \] where \(c_2\) and \(c_5\) are constants and \(c<0.84\). In the proof he uses the property that \(\zeta(s)=O\left(| t|^{1/2(L-1)+\varepsilon}\right)\) holds uniformly for \(\sigma\geq 1-l/2(L-1)\) and any \(\varepsilon>0\), where \(l\) is an integer \(\geq 3\) and \(L=2^{l-1}\). For nonintegral value \(l\) (as the author uses \(l=3.54\ldots\)), the previous result needs a proof.

Recommendations

Cited in

(16)

This page was built for publication: The average order of an arithmetic function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q767150)