[-] Show simple item record

dc.contributor.authorBanks, William David, 1964-eng
dc.contributor.authorHart, Derrick, 1980-eng
dc.contributor.authorSakata, Mayumieng
dc.descriptionFirst published in Mathematical Research Letters 11 (2004) nos.5-6, pp.853-868, published by International Press. ©International Press.eng
dc.description.abstractWe 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.eng
dc.relation.ispartofMathematics publications (MU)eng
dc.relation.ispartofcommunityUniversity of Missouri-Columbia. College of Arts and Sciences. Department of Mathematicseng
dc.subject.lcshNumber theoryeng
dc.subject.lcshModular arithmeticeng
dc.titleAlmost All Palindromes Are Compositeeng

Files in this item


This item appears in the following Collection(s)

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

[-] Show simple item record