Almost all palindromes are composite.
From MaRDI portal
Publication:1769992
DOI10.4310/MRL.2004.V11.N6.A10zbMATH Open1101.11039arXivmath/0405056MaRDI QIDQ1769992FDOQ1769992
Authors: William D. Banks, Derrick Hart, Mayumi Sakata 
Publication date: 5 April 2005
Published in: Mathematical Research Letters (Search for Journal in Brave)
Abstract: We study the distribution of palindromic numbers (with respect to a fixed base ) over certain congruence classes, and we derive a nontrivial upper bound for the number of prime palindromes as . Our results show that almost all palindromes in a given base are composite.
Full work available at URL: https://arxiv.org/abs/math/0405056
Recommendations
Radix representation; digital problems (11A63) Estimates on exponential sums (11L07) Distribution of integers in special residue classes (11N69)
Cited In (17)
- Additive number theory via automata theory
- Palindromes in Lucas sequences
- Reciprocal sum of palindromes
- Longest arithmetic progressions of palindromes
- Prime divisors of palindromes
- Title not available (Why is that?)
- Palindromes dans les progressions arithmétiques
- Every natural number is the sum of forty-nine palindromes
- On \(d\)-digit palindromes in different bases: the number of bases is unbounded
- Every positive integer is a sum of three palindromes
- Reversible primes
- Title not available (Why is that?)
- Exact formulas for the number of palindromes in certain arithmetic progressions
- Generalization of a theorem of Carlitz
- Palindromes in linear recurrence sequences
- Sum of digits and distribution in congruence classes for palindromes with missing digits
- On binary palindromes of the form \(10^n\pm 1\)
This page was built for publication: Almost all palindromes are composite.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1769992)
