Add to ORKGFirst published in Mathematical Research Letters 11 (2004) nos.5-6, pp.853-868, published by International Press. ©International Press.We study the distribution of palindromic numbers (with respect to a fixed base g ≥ 2) over certain congruence classes, and we derive a nontrivial upper bound for the number of prime palindromes n ≤ x as x → ∞. Our results show that almost all palindromes in a given base are composite
Everybody has certainly heard about palindromes: words that stay the same when read backwards. For i...
After the proof of Zhang about the existence of infinitely many bounded gaps between consecutive pri...
Everybody has certainly heard about palindromes: words that stay the same when read backwards. For i...
http://www.math.missouri.edu/~bbanks/papers/index.htmlIn this paper, we study some divisibility prop...
AbstractIn this paper we modify the usual sieve methods to study the distribution of almost primes i...
In this paper, we study some divisibility properties of palindromic numbers in a fixed base g ≥ 2. I...
AbstractLetΓbe a finitely generated subgroup of Q* with rankr. We study the size of the order |Γp| o...
summary:In this note, we show that the counting function of the number of composite positive integer...
Let $0Frobenius number $g(a,b)=ab-a-b$. In this note, we prove that there exists a prime number $p\i...
International audienceWe show that, for any fixed $\varepsilon > 0$ and almost all primes $p$, the $...
summary:In this note, we show that the counting function of the number of composite positive integer...
In 2020, Roger Baker \cite{Bak} proved a result on the exceptional set of moduli in the prime number...
http://www.math.missouri.edu/~bbanks/papers/index.htmlLet P(n) denote the largest prime factor of an...
AbstractLet a be an integer ≠−1 and not a square. Let Pa(x) be the number of primes up to x for whic...
AbstractFor any positive integer n, let wn=(2n−1n−1)=12(2nn). Wolstenholme proved that if p is a pri...
Everybody has certainly heard about palindromes: words that stay the same when read backwards. For i...
After the proof of Zhang about the existence of infinitely many bounded gaps between consecutive pri...
Everybody has certainly heard about palindromes: words that stay the same when read backwards. For i...
http://www.math.missouri.edu/~bbanks/papers/index.htmlIn this paper, we study some divisibility prop...
AbstractIn this paper we modify the usual sieve methods to study the distribution of almost primes i...
In this paper, we study some divisibility properties of palindromic numbers in a fixed base g ≥ 2. I...
AbstractLetΓbe a finitely generated subgroup of Q* with rankr. We study the size of the order |Γp| o...
summary:In this note, we show that the counting function of the number of composite positive integer...
Let $0Frobenius number $g(a,b)=ab-a-b$. In this note, we prove that there exists a prime number $p\i...
International audienceWe show that, for any fixed $\varepsilon > 0$ and almost all primes $p$, the $...
summary:In this note, we show that the counting function of the number of composite positive integer...
In 2020, Roger Baker \cite{Bak} proved a result on the exceptional set of moduli in the prime number...
http://www.math.missouri.edu/~bbanks/papers/index.htmlLet P(n) denote the largest prime factor of an...
AbstractLet a be an integer ≠−1 and not a square. Let Pa(x) be the number of primes up to x for whic...
AbstractFor any positive integer n, let wn=(2n−1n−1)=12(2nn). Wolstenholme proved that if p is a pri...
Everybody has certainly heard about palindromes: words that stay the same when read backwards. For i...
After the proof of Zhang about the existence of infinitely many bounded gaps between consecutive pri...
Everybody has certainly heard about palindromes: words that stay the same when read backwards. For i...