Almost All Palindromes Are Composite

MOspace/Manakin Repository

Breadcrumbs Navigation

Almost All Palindromes Are Composite

Please use this identifier to cite or link to this item:

[-] show simple item record Banks, William David, 1964- Hart, Derrick, 1980- Sakata, Mayumi 2011-05-05T21:38:59Z 2011-05-05T21:38:59Z 2004
dc.description First published in Mathematical Research Letters 11 (2004) nos.5-6, pp.853-868, published by International Press. ©International Press. en_US
dc.description.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. en_US
dc.language.iso en_US en_US
dc.relation.ispartof Mathematics publications (MU) en
dc.source.uri en_US
dc.subject.lcsh Number theory en_US
dc.subject.lcsh Modular arithmetic en_US
dc.title Almost All Palindromes Are Composite en_US
dc.type Preprint en_US
dc.relation.ispartofcommunity University of Missouri-Columbia. College of Arts and Sciences. Department of Mathematics

This item appears in the following Collection(s)

  • Mathematics publications (MU) [119]
    The items in this collection are the scholarly output of the faculty, staff, and students of the Department of Mathematics.

[-] show simple item record