arXiv · math/0405056
Almost all palindromes are composite
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.
Explore related subjects
Keep this discovery
William D. Banks, Derrick N. Hart, Mayumi Sakata. 2004-05-04. Almost all palindromes are composite. https://arxiv.org/abs/math/0405056
Cite the original work for its findings. Save a collection to share your selection of sources.