Interprets Corollary 1.5 in terms of "friable regularity," under extended definition from convergent series to partial sums of arbitrary sequences. Incorporates referee comments
发表信息：
Integers 21A (2021), Ron Graham Memorial Volume, #A17, 15 pp
In 1874, Mertens famously proved an asymptotic formula for the product $p/(p-1)$ over all primes $p$ up to $x$. On the other hand, one may expand Mertens' prime product into series over numbers $n$ with only small prime factors. It is natural to restrict such series to numbers $n$ with a fixed number $k$ of prime factors. In this article, we obtain formulae for these series for each $k$, which together dissect Mertens' original estimate. The proof is by elementary methods of a combinatorial flavor.
For $k\ge1$, a $k$-almost prime is a positive integer with exactly $k$ prime factors, counted with multiplicity. In this article we give elementary proofs of precise asymptotics for the reciprocal sum of $k$-almost primes. Our results match the strength of those of classical analytic methods. We also study the limiting behavior of the constants appearing in these estimates, which may be viewed as higher analogues of the Mertens constant $β=0.2614...$ Further, in the case $k=2$ of semiprimes we give yet finer-scale and explicit estimates, as well as a conjecture.
In 1874, Mertens proved the approximate formula for partial Euler product for Riemann zeta function at $s=1$, which is called Mertens' theorem. In this paper, we generalize Mertens' theorem for Selberg class and show the prime number theorem for Selberg class.
In this note we give some identities which involve the Mertens function M(n). Our proofs are combinatorial with relatively prime subsets as a main tool.
For $k\ge1$, let $R_k(x)$ denote the reciprocal sum up to $x$ of numbers with $k$ prime factors, counted with multiplicity. In prior work, the authors obtained estimates for $R_k(x)$, extending Mertens' second theorem, as well as a finer-scale estimate for $R_2(x)$ up to $(\log x)^{-N}$ error for any $N > 0$. In this article, we establish the limiting behavior of the higher Mertens constants from the $R_2(x)$ estimate. We also extend these results to $R_3(x)$, and we remark on the general case $k\ge4$.
Myriad articles are devoted to Mertens's theorem. In yet another, we merely wish to draw attention to a proof by Hardy, which uses a Tauberian theorem of Landau that "leads to the conclusion in a direct and elegant manner". Hardy's proof is also quite adaptable, and it is readily combined with well-known results from prime number theory. We demonstrate this by proving a version of the theorem for primes in arithmetic progressions with uniformity in the modulus, as well as a non-abelian analogue of this.
Extending a classical estimate of Mertens for the sum of the reciprocals of the first primes, we provide an explicit remainder formula for products of an arbitrary, but fixed, number of primes.
This note simplifies the proof of a recent result on the oscillation of the prime product in Martens Theorem, and provides a quantitative expression for the error term. In addition, the corresponding oscillation results for the finite sums of the reciprocal of the primes up to a fixed number and other finite sums and products are also given.
The Mertens' first theorem gives us the following asymptotic formula \begin{equation*} \sum_{\substack{p\leq x\\ p~prime}}\frac{lnp}{p}=lnx+O(1), \end{equation*} and the Mertens' second theorem indicates that there exists a constant $B\approx 0.261$, named the Mertens constant, such that \begin{equation*} \sum_{\substack{p\leq x\\ p~prime}}\frac{1}{p}=ln(lnx)+B+O\left(\frac{1}{lnx}\right). \end{equation*} In this paper, by using the Abel summation formula and Dirichlet's hyperbola method, we extend them to multiple cases.
Assuming the validity of Riemann Hypothesis (RH), we derive the explicit bilateral estimates ("narrow passage") of the remainder in the modified Mertens asymptotic formula for the sums of primes' reciprocals. These results are reversable, thus yielding some new criteria for RH.
A highly strong upper estimate in the modified asymptotic formula for sums of the primes' reciprocals is proved to be necessary (as well as sufficient) in order the Ramanujan inequality holds true. Some other criteria in similar terms are also obtained.
We give explicit numerical values with 100 decimal digits for the constant in the Mertens product over primes in the arithmetic progressions $a \bmod q$, for $q \in \{3$, ..., $100\}$ and $(a, q) = 1$.
In this article, we prove a generalisation of the Mertens theorem for prime numbers to number fields and algebraic varieties over finite fields, paying attention to the genus of the field (or the Betti numbers of the variety), in order to make it tend to infinity and thus to point out the link between it and the famous Brauer-Siegel theorem. Using this we deduce an explicit version of the generalised Brauer-Siegel theorem under GRH, and a unified proof of this theorem for asymptotically exact families of almost normal number fields.
A square-free integer is a positive integer that is not divisible by the square of any prime. Merten's function, $M(x)$ is defined as the difference between the number of square free integers with an even number of prime factors and the number of those with an odd number of prime factors up to $x$. It's well known that $M(x)=O(x^{1/2+ε})$ is equivalent to Riemann Hypothesis. In this paper, we derive a new equation involving Merten's function that leads to a promising technique for Riemann Hypothesis.
We develop the relation between hyperbolic geometry and arithmetic equidistribution problems that arises from the action of arithmetic groups on real hyperbolic spaces, especially in dimension up to 5. We prove generalisations of Mertens' formula for quadratic imaginary number fields and definite quaternion algebras over the rational numbers, counting results of quadratic irrationals with respect to two different natural complexities, and counting results of representations of (algebraic) integers by binary quadratic, Hermitian and Hamiltonian forms with error bounds. For each such statement, …
The classical Mertens' formula states that $ \prod_{p\le N}\big(1-\frac1p)^{-1}\sim e^γ\log N, $ where the product is over all primes $p$ less than or equal to $N$, and $γ$ is the Euler-Mascheroni constant. By the Euler product formula, this is equivalent to either of the following statements: $$ \begin{aligned} &i. \lim_{N\to\infty}\frac{\sum_{n:p|n\Rightarrow p\le N}\thinspace\frac1n}{\sum_{n\le N}\frac1n}=e^γ \ &ii. \sum_{n:p|n\Rightarrow p\le N}\thinspace\frac1n\sim e^γ\log N. \end{aligned} $$ Via some random integer constructions and a criterion for weak convergence of distributions to so…
The validity of the Riemann Hypothesis (RH) on the location of the non-trivial zeros of the Riemann $ζ$-function is directly related to the growth of the Mertens function $M(x) \,=\,\sum_{k=1}^x μ(k)$, where $μ(k)$ is the Möbius coefficient of the integer $k$: the RH is indeed true if the Mertens function goes asymptotically as $M(x) \sim x^{1/2 + ε}$, where $ε$ is an arbitrary strictly positive quantity. This behavior can be established on the basis of a new probabilistic approach based on the global properties of Mertens function. To this aim we derive a series of probabilistic results conce…
The counting function on the natural numbers defines a discrete Morse-Smale complex with a cohomology for which topological quantities like Morse indices, Betti numbers or counting functions for critical points of Morse index are explicitly given in number theoretical terms. The Euler characteristic of the Morse filtration is related to the Mertens function, the Poincaré-Hopf indices at critical points correspond to the values of the Moebius function. The Morse inequalities link number theoretical quantities like the prime counting functions relevant for the distribution of primes with cohomol…
A primorial prime is a prime number of the form $p_n\# \pm 1$ where $p_n\#$ denotes the product of all primes less than or equal to $p_{n}$, the $n$-th prime. We show that the probability along the lines of Mertens' Theorem that either $p_n\# -1$ or $p_n\# +1$ is prime is $O(n^{-1})$ and that the probability that both $p_n\# -1$ and $p_n\# +1$ are prime is $O(n^{-2})$, for $n>1$. The latter result provides evidence that there are in total three instances where both $p_n\# -1$ and $p_n\# +1$ are prime. We provide proof that numbers of the from $p_n\# \pm 1$ have the highest probability of being…
We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j, q)=1$ $(q \geq 3, 1\leq j\leq k)$. For any $A>0$, our result is uniform for $2\leq k\leq A\log\log x$. Moreover, we show that, there are large biases toward certain arithmetic progressions $(a_1 \bmod q, \cdots, a_k \bmod q)$, and such biases have connections with Mertens' theorem and the least prime in arithmetic progressions.
Consider the product of (1-p^(-s))^(-4) over all primes p=1 mod 5. We evaluate its residue at s=1 and compare with the corresponding Mertens constant of Languasco & Zaccagnini. We also count primitive quintic Dirichlet characters mod n and determine their average number as n->infty.
We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related sum over rational primes. For a given $f \in \mathbb{Z}[x]$, our result yields a finite list of primes that certifies the number of distinct irreducible factors of $f$.
Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of nonempty subsets of $A$ which are relatively prime and the number of nonempty subsets of $A$ which are relatively prime to $n$. Related formulas are also obtained for the number of such subsets having some fixed cardinality. This extends previous work for the cases where $A$ is an interval or a set in arithmetic progression. Applications include: a) An exact formul…
Rubinstein and Sarnak have shown, conditional on the Riemann hypothesis (RH) and the linear independence hypothesis (LI) on the non-real zeros of $ζ(s)$, that the set of real numbers $x\ge2$ for which $π(x)>$ li$(x)$ has a logarithmic density, which they computed to be about $2.6\times10^{-7}$. A natural problem is to examine the actual primes in this race. We prove, assuming RH and LI, that the logarithmic density of the set of primes $p$ for which $π(p)>$ li$(p)$ relative to the prime numbers exists and is the same as the Rubinstein-Sarnak density. We also extend such results to a broad clas…
Analogues of the prime number theorem and Merten's theorem are well-known for dynamical systems with hyperbolic behaviour. In this paper a 3-adic extension of the circle doubling map is studied. The map has a 3-adic eigendirection in which it behaves like an isometry, and the loss of hyperbolicity leads to weaker asymptotic results on orbit counting than those obtained for hyperbolic maps.
The Mertens function, $M(x) := \sum_{n \leq x} μ(n)$, is defined as the summatory function of the classical Möbius function. The Dirichlet inverse function $g(n) := (ω+1)^{-1}(n)$ is defined in terms of the shifted strongly additive function $ω(n)$ that counts the number of distinct prime factors of $n$ without multiplicity. The Dirichlet generating function (DGF) of $g(n)$ is $ζ(s)^{-1} (1+P(s))^{-1}$ for $\Re(s) > 1$ where $P(s) = \sum_p p^{-s}$ is the prime zeta function. We study the distribution of the unsigned functions $|g(n)|$ with DGF $ζ(2s)^{-1}(1-P(s))^{-1}$ and $C_Ω(n)$ with DGF $(…
In this paper, we show that Riemann hypothesis (concerning zeros of the zeta function in the critical strip) is equivalent to the analytic continuation of Euler products obtained by restricting the Euler zeta product to suitable subsets $M_k$, $k\geq 1$ of the set of prime numbers. Each of these Euler product defines so a partial zeta function $ζ_{k}(s)$ equal to a Dirichlet series of the form $\sum ε(n)/n^s$, with coefficients $ε(n)$ equal to 0 or 1 as n belongs or not to the population of integers generated by $M_k$. We show that usual formulas of the arithmetic adapt themselves to such popu…
