solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看84次
Mertens Sums requiring Fewer Values of the M\"{o}bius function. (arXiv:1807.05890v1 [math.NT])
来源于:arXiv
We discuss certain identities involving $\mu(n)$ and $M(x)=\sum_{n\leq
x}\mu(n)$, the functions of M\"{o}bius and Mertens. These identities allow
calculation of $M(N^d)$, for $d=2,3,4,\ldots\ $, as a sum of $O_d \left(
N^d(\log N)^{2d - 2}\right)$ terms, each a product of the form $\mu(n_1) \cdots
\mu(n_r)$ with $r\leq d$ and $n_1,\ldots , n_r\leq N$. We prove a more general
identity in which $M(N^d)$ is replaced by $M(g,K)=\sum_{n\leq K}\mu(n)g(n)$,
where $g(n)$ is an arbitrary totally multiplicative function, while each $n_j$
has its own range of summation, $1,\ldots , N_j$. We focus on the case $d=2$,
$K=N^2$, $N_1=N_2=N$, where the identity has the form $M(g,N^2) = 2 M(g,N) -
{\bf m}^{\rm T} A {\bf m}$, with $A$ being the $N\times N$ matrix of elements
$a_{mn}=\sum _{k \leq N^2 /(mn)}\,g(k)$, while ${\bf m}=(\mu (1)g(1),\ldots
,\mu (N)g(N))^{\rm T}$. Our results in Sections 2 and 3 assume, moreover, that
$g(n)$ equals $1$ for all $n$. In this case the Perron-Frobenius theorem
appli 查看全文>>