中文

除数函数的第$r$阶矩:一种初等方法

数论 2017-07-05 v2

摘要

τ(n)\tau(n)nn的除数个数。我们给出如下事实的初等证明:对于任意整数r2r\ge 2,有nxτ(n)r=xCr(logx)2r1+O(x(logx)2r2). \sum_{n\le x} \tau(n)^r =xC_{r} (\log x)^{2^r-1}+O(x(\log x)^{2^r-2}). 此处,Cr=1(2r1)!p2((11p)2r(α0(α+1)rpα)). C_{r}=\frac{1}{(2^r-1)!} \prod_{p\ge 2}\left( \left(1-\frac{1}{p}\right)^{2^r} \left(\sum_{\alpha\ge 0} \frac{(\alpha+1)^r}{p^{\alpha}}\right)\right).

关键词

引用

@article{arxiv.1703.08785,
  title  = {The $r$th moment of the divisor function: an elementary approach},
  author = {Florian Luca and László Tóth},
  journal= {arXiv preprint arXiv:1703.08785},
  year   = {2017}
}

备注

8 pages, revised