Mathematical Research Letters

Volume 11, Issue 6, November 2004 pp. 853-868.

Almost All Palindromes Are Composite

Authors: William D. Banks, Derrick N. Hart, and Mayumi Sakata
Author institution: University of Missouri, Georgia Institute of Technology, and William Jewell College

Summary: 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.

Contents Full-Text PDF