AbstractWe use the explicit formula of V. Shevelev for the best possible exponent α(m) in the error term of the asymptotic formula of A.O. Gelfond on the number of positive integers n⩽x in a given residue class modulo m and a given parity of the sum of its binary digits, to obtain new results about its behaviour. In particular, our result implies thatlim infp→∞α(p)=0 where p runs through the set of primes, which has been derived by V. Shevelev from Artin's conjecture
AbstractLet x1,…,xr be a sequence of elements of Zn, the integers modulo n. How large must r be to g...
International audienceA new derivation of the classic asymptotic expansion of the n-th prime is pres...
Let Ω(n) denote the number of prime divisors of n counting multiplicity. One can show that for any p...
We use the explicit formula of V. Shevelev for the best possible exponent α(m) in the error term of ...
La présente thèse a été fortement influencée par deux conjectures, l'une de Gelfond et l'autre de Sa...
The original Gelfond-Schnirelman method, proposed in 1936, uses polynomials with integer coe#cients ...
AbstractLet p1,p2,… be the sequence of all primes in ascending order. The following result is proved...
Let P(x,d,a) denote the number of primes p<=x with p=a(mod d). Chebyshev's bias is the phenomenon th...
study the Mertens product over primes in arithmetic progressions, and find a uniform version of prev...
In this masters thesis we prove by contradiction the irrationality of the numbers e, π 2 , and √n m,...
ABSTRACT. Chebyshev was the first to observe a bias in the distribution of primes in residue classes...
Using elementary techniques, a question named after the famous Russian mathematician I. M. Gelfand i...
n this paper we study the sum of powers of the Gaussian integers Gk(n):=¿a,b¿[1,n](a+bi)k. We give a...
An important aspect of Diophantine Approximation deals with the problem of approximating real or com...
An asymptotic formula for p(n), precise enough to give the exact value, was given by Hardy and Raman...
AbstractLet x1,…,xr be a sequence of elements of Zn, the integers modulo n. How large must r be to g...
International audienceA new derivation of the classic asymptotic expansion of the n-th prime is pres...
Let Ω(n) denote the number of prime divisors of n counting multiplicity. One can show that for any p...
We use the explicit formula of V. Shevelev for the best possible exponent α(m) in the error term of ...
La présente thèse a été fortement influencée par deux conjectures, l'une de Gelfond et l'autre de Sa...
The original Gelfond-Schnirelman method, proposed in 1936, uses polynomials with integer coe#cients ...
AbstractLet p1,p2,… be the sequence of all primes in ascending order. The following result is proved...
Let P(x,d,a) denote the number of primes p<=x with p=a(mod d). Chebyshev's bias is the phenomenon th...
study the Mertens product over primes in arithmetic progressions, and find a uniform version of prev...
In this masters thesis we prove by contradiction the irrationality of the numbers e, π 2 , and √n m,...
ABSTRACT. Chebyshev was the first to observe a bias in the distribution of primes in residue classes...
Using elementary techniques, a question named after the famous Russian mathematician I. M. Gelfand i...
n this paper we study the sum of powers of the Gaussian integers Gk(n):=¿a,b¿[1,n](a+bi)k. We give a...
An important aspect of Diophantine Approximation deals with the problem of approximating real or com...
An asymptotic formula for p(n), precise enough to give the exact value, was given by Hardy and Raman...
AbstractLet x1,…,xr be a sequence of elements of Zn, the integers modulo n. How large must r be to g...
International audienceA new derivation of the classic asymptotic expansion of the n-th prime is pres...
Let Ω(n) denote the number of prime divisors of n counting multiplicity. One can show that for any p...
DOI
Add to ORKG