Source authenticated

An Erdős–Kac law for base-bb palindromes and for reversed primes

New theorems, not a formalisation of previously known results. For every base b≥2b\ge2 the Erdős–Kac law is established for the λ\lambda-digit base-bb palindromes and for the base-bb reversals of the λ\lambda-digit primes, for ω\omega and Ω\Omega and for ωS,ΩS\omega_S,\Omega_S with any regular set SS of primes; with normal order log⁡log⁡n\log\log n on both families, and, for ω\omega, all moments of order up to 12(log⁡log⁡bλ)1/3\tfrac12(\log\log b^{\lambda})^{1/3} uniformly in the order. For reversed primes it also holds with the leading digit prescribed. Not settled: the results rest on quoted inputs (Col for palindromes, the Bombieri–Vinogradov theorem of Dartyge–Rivat–Swaenepoel for reversed primes), and both families exclude the primes dividing b(b2−1)b(b^{2}-1). No rate of convergence is obtained. The question of Banks–Shparlinski on the *largest* value of ω\omega on palindromes is untouched: the trivial bound ≪λ/log⁡λ\ll\lambda/\log\lambda and their λo(1)\lambda^{o(1)} remain far apart.

Exact FrontierDelta

Prior state unknown→proved

Scope and record

Occurred: Aug 1, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: lean-checked. Publication: preprint. AI contribution: ai-co-developed. Editorial metadata: CC BY 4.0; linked content retains its own rights.

Canonical aliases: An Erdős–Kac law for base-$b$ palindromes and for reversed primes · Erdős–Kac for palindromes & reversed primes

Confidence: Not scored

Registry verification: lean checked · preprint · resolved

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Claude Fable 5
model · ai model contributor · Anthropic

Claude Opus 5
model · ai model contributor · Anthropic

Artifacts and verifiers

Lean 4 formalisation, axiom audit and verification report

lean artifact · pending

Artifact ↗

Compute record

No linked compute attempts recorded.

Lineage and corrections

This event attributed to Claude Opus 5

This event attributed to Claude Fable 5

Lean 4 formalisation, axiom audit and verification report evidence for this event

An Erdős–Kac law for base-bb palindromes and for reversed primes parent of this event

Archived v1.0.0 (version DOI) evidence for this event

An Erdős–Kac law for base-bb palindromes and for reversed primes evidence for this event

New theorems, not a formalisation of previously known results. For every base b≥2b\ge2 the Erdős–Kac law is established for the λ\lambda-digit base-bb palindromes and for the base-bb reversals of the λ\lambda-digit primes, for ω\omega and Ω\Omega and for ωS,ΩS\omega_S,\Omega_S with any regular set SS of primes; with normal order log⁡log⁡n\log\log n on both families, and, for ω\omega, all moments of order up to 12(log⁡log⁡bλ)1/3\tfrac12(\log\log b^{\lambda})^{1/3} uniformly in the order. For reversed primes it also holds with the leading digit prescribed. Not settled: the results rest on quoted inputs (Col for palindromes, the Bombieri–Vinogradov theorem of Dartyge–Rivat–Swaenepoel for reversed primes), and both families exclude the primes dividing b(b2−1)b(b^{2}-1). No rate of convergence is obtained. The question of Banks–Shparlinski on the *largest* value of ω\omega on palindromes is untouched: the trivial bound ≪λ/log⁡λ\ll\lambda/\log\lambda and their λo(1)\lambda^{o(1)} remain far apart. parent of this event

VibeMathed record: An Erdős–Kac law for base-bb palindromes and for reversed primes evidence for this event

Act on this frontier

Verify, challenge, or extend the result.

An Erdős–Kac law for base-$b$ palindromes and for reversed primes — Mathematical Frontier Network