Related papers: The normality of digits in almost constant additiv…

Given an integer $b\geqslant 2$ and a set $P$ of prime numbers, the set $T_P $ of Toeplitz numbers comprises all elements of $[0,b[$ whose digits $(a_n)_{n\geqslant 1}$ in the base-$b$ expansion satisfy $a_n=a_{pn}$ for all $p\in P$ and…

The objective of this paper is the study of functions which only act on the digits of an expansion. In particular, we are interested in the asymptotic distribution of the values of these functions. The presented result is an extension and…

Many research works have concerned normality-preserving selection rules and operations on the sequence of digits of a given normal number that maintain or violate normality. This leads us to introduce rearrangement operations on finite…

Using rigorous high-precision floating point arithmetic we compute very tight rigorous bounds on the auto-convolution constant \[ \nu_2^2 = \inf_f \|f \ast f\|_2^2 = \inf_f \int_{-1}^1 (f \ast f)^2 \] where the infimum is taken over all…

A real number $x$ is normal with respect to an integer base $b \geq 2$ if its digit expansion in this base is ``equitable'', in the sense that for $k \geq 1$, every ordered sequence of $k$ digits from $\{0, 1, \ldots, b-1\}$ occurs in the…

We consider the continued fraction digits as random variables measured with respect to Lebesgue measure. The logarithmically scaled and normalized fluctuation process of the digit sums converges strongly distributional to a random variable…

A graph is normal if it admits a clique cover $\mathcal C$ and a stable set cover $\mathcal S$ such that each clique in $\mathcal C$ and each stable set in $\mathcal S$ have a vertex in common. The pair $(\mathcal{C,S})$ is a normal cover…

Two sums over the inverse of the product of an integer n and its greatest prime factor G(n), are computed to first 13 decimal digits. These sums converge, but converge very slowly. They are transformed into sums involving Mertens' prime…

We address the task of identifying anomalous observations by analyzing digits under the lens of Benford's law. Motivated by the crucial objective of providing reliable statistical analysis of customs declarations, we answer one major and…

We study the concentration of the distribution of an additive function, when the sequence of prime values of $f$ decays fast and has good spacing properties. In particular, we prove a conjecture by Erdos and Katai on the concentration of…

We prove a folklore conjecture concerning the sum-of-digits functions in bases two and three: there are infinitely many positive integers $n$ such that the sum of the binary digits of $n$ equals the sum of the ternary digits of $n$.

The following work is written in easy language for college level students. It shows how the first digit probabilities of a group of continuous real-valued functions can be calculated. Thus, examples explaining how the probabilities are…

Benford's Law predicts that the first significant digit on the leftmost side of numbers in real-life data is proportioned between all possible 1 to 9 digits approximately as in LOG(1 + 1/digit), so that low digits occur much more frequently…

In the paper we describe some properties of function $$ y=r(x)=\lim_{n\to\infty}\frac{1}{n}\sum^{\infty}_{k=1}\alpha_k(x), \text{ where } x=\sum^{\infty}_{k=1}\alpha_k(x)4^{-k} $$ of $4$-adic digits asymptotic mean of fractional part of…

Consider the operation of adding the same number of identical digits to the left and to the right of a number n. In OEIS sequence A090287, it was conjectured that this operation will not produce a prime if and only if n is a palindrome with…

The celebrated Erd\H{o}s--Kac theorem says, roughly speaking, that the values of additive functions satisfying certain mild hypotheses are normally distributed. In the intervening years, similar normal distribution laws have been shown to…

Let $s(n)$ denote the number of ones in the binary expansion of the nonnegative integer $n$. How does $s$ behave under addition of a constant $t$? In order to study the differences \[s(n+t)-s(n),\] for all $n\ge0$, we consider the…

A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we are investigating a proper subset of the left-computable numbers. We say that a real number…

An algorithm for sampling exactly from the normal distribution is given. The algorithm reads some number of uniformly distributed random digits in a given base and generates an initial portion of the representation of a normal deviate in…

Given a sequence $\mathscr{A}=\{a_0<a_1<a_2\ldots\}\subseteq \mathbb{N}$, let $r_{\mathscr{A},h}(n)$ denote the number of ways $n$ can be written as the sum of $h$ elements of $\mathscr{A}$. Fixing $h\geq 2$, we show that if $f$ is a…