DOIAbstract
AbstractLet k be an integer ≥ 1 and let l be an integer such that 1 ≤ l ≤ k, (l,k) = 1. An asymptotic formula (valid for large x) is obtained for the product ∏p≤x,p≡l(modk)1−1p, generalizing a familiar result of Mertens
AbstractLet k be an integer ≥ 1 and let l be an integer such that 1 ≤ l ≤ k, (l,k) = 1. An asymptotic formula (valid for large x) is obtained for the product ∏p≤x,p≡l(modk)1−1p, generalizing a familiar result of Mertens
AbstractIn a recent paper, K. Soundararajan showed, roughly speaking, that the integers smaller than...
We give estimates for the error term of the Mertens product over primes in arithmetic progressions...
While a different topic was investigated, it became necessary to know asymptotic values of products ...
Let k be an integer ≥ 1 and let l be an integer such that 1 ≤ l ≤ k, (l,k) = 1. An asymptotic formul...
We study the Mertens product over primes in arithmetic progressions, and find a uniform version of p...
Abstract of paper [1]. We study the Mertens product over primes in arithmetic progressions, and find...
AbstractWe study the Mertens product over primes in arithmetic progressions, and find a uniform vers...
We give explicit numerical values with 100 decimal digits for the Mertens constant involved in the...
AbstractLet k be an integer ≥ 1 and let l be an integer such that 1 ≤ l ≤ k, (l,k) = 1. An asymptoti...
We give new identities for the constants in the Mertens product over primes in the arithmetic pr...
We give explicit numerical values with 100 decimal digits for the constant in the Mertens product ov...
We give explicit numerical values with 100 decimal digits for the constant in the Mertens product o...
We obtain an asymptotic formula for the cube-full numbers in an arithmetic progression n≡lmod q, whe...
In this paper we prove a generalization of Mertens ’ theorem to Beurling primes, namely that limnÑ8 ...
The Siegel–Walfisz theorem states that for any B> 0, we have∑ p≤x p≡a (mod k) 1 ∼ x ϕ(k) log x fo...
AbstractIn a recent paper, K. Soundararajan showed, roughly speaking, that the integers smaller than...
We give estimates for the error term of the Mertens product over primes in arithmetic progressions...
While a different topic was investigated, it became necessary to know asymptotic values of products ...
Let k be an integer ≥ 1 and let l be an integer such that 1 ≤ l ≤ k, (l,k) = 1. An asymptotic formul...
We study the Mertens product over primes in arithmetic progressions, and find a uniform version of p...
Abstract of paper [1]. We study the Mertens product over primes in arithmetic progressions, and find...
AbstractWe study the Mertens product over primes in arithmetic progressions, and find a uniform vers...
We give explicit numerical values with 100 decimal digits for the Mertens constant involved in the...
AbstractLet k be an integer ≥ 1 and let l be an integer such that 1 ≤ l ≤ k, (l,k) = 1. An asymptoti...
We give new identities for the constants in the Mertens product over primes in the arithmetic pr...
We give explicit numerical values with 100 decimal digits for the constant in the Mertens product ov...
We give explicit numerical values with 100 decimal digits for the constant in the Mertens product o...
We obtain an asymptotic formula for the cube-full numbers in an arithmetic progression n≡lmod q, whe...
In this paper we prove a generalization of Mertens ’ theorem to Beurling primes, namely that limnÑ8 ...
The Siegel–Walfisz theorem states that for any B> 0, we have∑ p≤x p≡a (mod k) 1 ∼ x ϕ(k) log x fo...
AbstractIn a recent paper, K. Soundararajan showed, roughly speaking, that the integers smaller than...
We give estimates for the error term of the Mertens product over primes in arithmetic progressions...
While a different topic was investigated, it became necessary to know asymptotic values of products ...
Add to ORKG