Almost All Palindromes Are Composite


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. ∗MSC Numbers: 11A63, 11L07, 11N69 †Corresponding author 1 


Cite this paper

@inproceedings{Banks2004AlmostAP, title={Almost All Palindromes Are Composite}, author={William D. Banks and Derrick Hart and Mayumi Sakata}, year={2004} }