Mertens Sums requiring Fewer Values of the M\"obius function

Abstract

We discuss certain identities involving μ(n) and M(x)=Σn≤ xμ(n), the functions of M\"obius and Mertens. These identities allow calculation of M(Nd), for d=2,3,4,…\ , as a sum of Od ( Nd( N)2d - 2) terms, each a product of the form μ(n1) ·s μ(nr) with r≤ d and n1,… , nr≤ N. We prove a more general identity in which M(Nd) is replaced by M(g,K)=Σn≤ Kμ(n)g(n), where g(n) is an arbitrary totally multiplicative function, while each nj has its own range of summation, 1,… , Nj. We focus on the case d=2, K=N2, N1=N2=N, where the identity has the form M(g,N2) = 2 M(g,N) - m T A m, with A being the N× N matrix of elements amn=Σ k ≤ N2 /(mn)\,g(k), while m=(μ (1)g(1),… ,μ (N)g(N)) 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 applies: we find that A has an eigenvalue that is approximately (π2 /6)N2, with eigenvector approximately f = (1,1/2,1/3,… ,1/N) T, and that, for large N, the second-largest eigenvalue lies in (-0.58 N, -0.49 N). Estimates for the traces of A and A2 are obtained. We discuss ways to approximate m T A m, using the spectral decomposition of A, or Perron's formula: the latter approach leads to a contour integral involving the Riemann zeta-function. We also discuss using the identity A = N2\, f\, \! fT - 1 2 u uT + Z, where u = (1,… ,1) T and Z is the N× N matrix of elements zmn = - (N2 / (mn)), with (x)=x - x - 1 2.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…