Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2504.10394

Digits of pi: limits to the seeming randomness II

Paula Nataniela Roba·Karlis Podnieks
View original source ↗Read source document ↗Export metadata ↓

Abstract

According to a popular belief, the decimal digits of mathematical constants such as π behave like statistically independent random variables, each taking the values 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9 with equal probability of 1/10. If this is the case, then, in particular, the decimal representations of these constants should tend to satisfy the central limit theorem (CLT) and the law of the iterated logarithm (LIL). The paper presents the results of a direct statistical analysis of the decimal representations of 12 mathematical constants with respect to the central limit theorem (CLT) and the law of the iterated logarithm (LIL). The first billion digits of each constant were analyzed, with ten billion digits examined in the case of π. Within these limits, no evidence was found to suggest that the digits of these constants satisfy CLT or LIL.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paula Nataniela Roba, Karlis Podnieks. 2025-04-14. Digits of pi: limits to the seeming randomness II. https://arxiv.org/abs/2504.10394

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT↗
arXiv2026

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT↗