Almost all palindromes are composite

Simple item page
dc.creatorBanks, William D.
dc.creatorHart, Derrick N.
dc.creatorSakata, Mayumi
dc.date2004-05-04
dc.date.accessioned2026-07-07T05:07:55Z
dc.date.available2026-07-07T05:07:55Z
dc.descriptionWe 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.
dc.description19 pages
dc.identifierhttps://arxiv.org/abs/math/0405056
dc.identifierhttp://arxiv.org/abs/math/0405056
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/71054
dc.subjectNumber Theory
dc.subject11A63; 11L07; 11N69
dc.titleAlmost all palindromes are composite
dc.typetext

Files

Collections

arXiv