We obtain a new lower bound on the number of prime divisors of integers whose g-ary expansion contains a fixed number of nonzero digits.7 page(s
International audienceLet Λ(n) be the von Mangoldt function, x real and 2 ≤ y ≤ x. This paper improv...
Let n> 1 be a positive integer, and n = pα11 · · · pαrr its prime factorization. A number d | n...
AbstractLet Q be a set of primes having relative density δ among the primes, with 0<δ<1, and let ψ(x...
Let g ≥ 2 be an integer and let (u n ) n≥1 be a sequence of integers which satisfies a relation u n+...
During the preparation of this paper, the first author was partially supported by project MTM2014-55...
AbstractAn Erdös-Kac type theorem is proved for the set S(x, y) = {n ≤ x: pβn ⇒ p ≤ y}, with a unifo...
International audienceLet p be a prime number, q = p(r) with r >= 2 and P is an element of F-q[X]. I...
This is a preprint of an article published in the Illinois Journal of Mathematics, 46 (2002) no.3, p...
AbstractLet x1,…,xr be a sequence of elements of Zn, the integers modulo n. How large must r be to g...
We give nontrivial bounds in various ranges for exponential sums of the form [equation omitted for f...
0. Abstract. We will consider the set fk j (k; s(k)) = 1g and its complement. Here, s(k) denotes th...
Sieve methods have been developed as tools for establishing the existence of prime numbers, or else ...
An x-pseudopower to base g is a positive integer which is not a power of g yet is so modulo p for al...
: We show that, for any fixed " ? 0, there are asymptotically the same number of integers up to...
AbstractLet 1=d1(n)<d2(n)<⋯<dτ(n)=n be the sequence of all positive divisors of the integer n in inc...
International audienceLet Λ(n) be the von Mangoldt function, x real and 2 ≤ y ≤ x. This paper improv...
Let n> 1 be a positive integer, and n = pα11 · · · pαrr its prime factorization. A number d | n...
AbstractLet Q be a set of primes having relative density δ among the primes, with 0<δ<1, and let ψ(x...
Let g ≥ 2 be an integer and let (u n ) n≥1 be a sequence of integers which satisfies a relation u n+...
During the preparation of this paper, the first author was partially supported by project MTM2014-55...
AbstractAn Erdös-Kac type theorem is proved for the set S(x, y) = {n ≤ x: pβn ⇒ p ≤ y}, with a unifo...
International audienceLet p be a prime number, q = p(r) with r >= 2 and P is an element of F-q[X]. I...
This is a preprint of an article published in the Illinois Journal of Mathematics, 46 (2002) no.3, p...
AbstractLet x1,…,xr be a sequence of elements of Zn, the integers modulo n. How large must r be to g...
We give nontrivial bounds in various ranges for exponential sums of the form [equation omitted for f...
0. Abstract. We will consider the set fk j (k; s(k)) = 1g and its complement. Here, s(k) denotes th...
Sieve methods have been developed as tools for establishing the existence of prime numbers, or else ...
An x-pseudopower to base g is a positive integer which is not a power of g yet is so modulo p for al...
: We show that, for any fixed " ? 0, there are asymptotically the same number of integers up to...
AbstractLet 1=d1(n)<d2(n)<⋯<dτ(n)=n be the sequence of all positive divisors of the integer n in inc...
International audienceLet Λ(n) be the von Mangoldt function, x real and 2 ≤ y ≤ x. This paper improv...
Let n> 1 be a positive integer, and n = pα11 · · · pαrr its prime factorization. A number d | n...
AbstractLet Q be a set of primes having relative density δ among the primes, with 0<δ<1, and let ψ(x...
DOI
Add to ORKG