Almost all palindromes are composite

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
19 pages

Keywords

Number Theory, 11A63; 11L07; 11N69

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/71054

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0405056
 http://arxiv.org/abs/math/0405056

Collections

arXiv