Almost all palindromes are composite
William D. Banks, Derrick N. Hart, Mayumi Sakata
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.
Create a lesson
Related papers
Unit fraction representations using shifted Golomb primes
Rishika Agrawal
Improved deterministic integer factorization by quadratic-image sieving
Pantelimon Stănică
Private key sieves for improved attacks on RSA
Markus Hittmeir
Multiple q-zeta values as polynomials in partition multiplicities
Jan-Willem M. van Ittersum
Hopf-Galois Structures on Extensions Arising from Division Points on Elliptic Curves
Leolin Nkuete
Certified Collision Exclusion and an Unconditional Upper Bound Λ<0.156821 for the de Bruijn--Newman Constant
Michel Planat, Dale James Raymond