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: http://hdl.handle.net/10355/10648

[+] show full item record


Title: Almost All Palindromes Are Composite
Author: Banks, William David, 1964-; Hart, Derrick, 1980-; Sakata, Mayumi
Date: 0000
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.
URI: http://hdl.handle.net/10355/10648

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 full item record