An Erdős–Kac law for base-b palindromes and for reversed primes
Statement
For every base , the number of prime factors of the -digit base- palindromes, and of the base- reversals of the -digit primes, obeys an Erdős–Kac law: counted with or without multiplicity, it is asymptotically normal with centring and scaling . For reversed primes the law persists when the leading digit of the prime is prescribed. Erdős–Kac laws were already known for other digitally defined families — integers with a fixed digit sum, or with digits restricted to a fixed set — but for palindromes only the largest value of had been studied, with nothing known about the typical value, and for reversed primes the level of distribution the argument needs became available only in 2025.
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.