Almost all palindromes are composite
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.