Almost all palindromes are composite
classification
🧮 math.NT
keywords
palindromesalmostbasecompositeboundcertainclassescongruence
read the original abstract
We study the distribution of palindromic numbers (with respect to a fixed base $g\ge 2$) over certain congruence classes, and we derive a nontrivial upper bound for the number of prime palindromes $n\le x$ as $x\to\infty$. Our results show that almost all palindromes in a given base are composite.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.