ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For every base b≥2b\ge2, the number of prime factors of the λ\lambda-digit base-bb palindromes, and of the base-bb reversals of the λ\lambda-digit primes, obeys an Erdős–Kac law: counted with or without multiplicity, it is asymptotically normal with centring log⁡log⁡bλ\log\log b^{\lambda} and scaling log⁡log⁡bλ\sqrt{\log\log b^{\lambda}}. 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 ω\omega 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
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.