Probabilistic Proofs of Some Generalized Mertens' Formulas Via Generalized Dickman Distributions
Abstract
The classical Mertens' formula states that Πp N(1-1p)-1 eγ 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: aligned &i. N∞Σn:p|n⇒ p N1nΣn N1n=eγ\ \ &ii. Σn:p|n⇒ p N1n eγ N. aligned Via some random integer constructions and a criterion for weak convergence of distributions to so-called generalized Dickman distributions, we obtain some generalized Mertens' formulas, some of which are new and some of which have been proved using number-theoretic tools. For example, in the spirit of (i), we show that if A is a subset of the primes which has natural density θ∈(0,1] with respect to the set of all primes, then N∞Σn:p|n⇒ p N p∈ A1n Σn N:p|n⇒ p∈ A1n=eγθ(θ+1), and also, for any k2, N∞Σ'(k)n:p|n⇒ p N p∈ A1n Σ'(k)n N:p|n⇒ p∈ A1n=eγθ(θ+1), where Σ'(k) denotes that the summation is restricted to k-free positive integers. In the spirit of (ii), we show for example that Σ'(k)n:p|n⇒ p N1n\(k-1)-free\φ(n\(k-1)-power\) eγ N, where φ is the Euler totient function, and n\(k-1)-free\ and n\(k-1)-power\ are the (k-1)-free part and the (k-1)-power part of n.