vix.ing · top · new · best · stats · spec

Almost all palindromes are composite

2004/05/04 by William D. Banks, Derrick Hart, Banks, William D. +4
Mathematics · #11A63 #11L07 #11N69 #Analytic Number Theory Research #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory #Number Theory (math.NT) #math.NT #msc:11A63 #msc:11L07 #msc:11N69

paper · pdf · doi:10.48550/arxiv.math/0405056

19 pages

arxiv created 2004/05/04 · openalex publication_date 2004/05/04 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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.

Related