相关论文: Ternary Digits of Powers of Two

We consider the set of finite sequences of length n over a finite or countable alphabet C. We consider the function which associate each given sequence with the size of the maximum overlap with a (shifted) copy of itself. We compute the…

We determine the leading digit laws for the matrix components of a linear Lie group $G$. These laws generalize the observations that the normalized Haar measure of the Lie group $\mathbb{R}^+$ is $dx/x$ and that the scale invariance of…

Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we investigate the notion of uniform distribution of letters…

De, Trevisan and Tulsiani [CRYPTO 2010] show that every distribution over $n$-bit strings which has constant statistical distance to uniform (e.g., the output of a pseudorandom generator mapping $n-1$ to $n$ bit strings), can be…

Fix a positive integer $N\geq2$. For a real number $x\in[0,1]$ and a digit $i\in\{0, 1,...,N-1\}$, let $\Pi_i(x, n)$ denote the frequency of the digit $i$ among the first $n$ $N$-adic digits of $x$. It is well-known that for a typical (in…

In this note, we are interested in obtaining uniform upper bounds for the number of powerful numbers in short intervals $(x, x + y]$. We obtain unconditional upper bounds $O(\frac{y}{\log y})$ and $O(y^{11/12})$ for all powerful numbers and…

We give metric theorems for the property of Borel normality for real numbers under the assumption of digit dependencies in their expansion in a given integer base. We quantify precisely how much digit dependence can be allowed such that,…

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…

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in…

Let $K_n$ denote the number of distinct values among the first $n$ terms of an infinite exchangeable sequence of random variables $(X_1,X_2,\ldots)$. We prove for $n=3$ that the extreme points of the convex set of all possible laws of $K_3$…

Consider the sequence of continued fraction convergents $p_n/q_n$ to a random irrational number. We study the distribution of the sequences $p_n \pmod{m}$ and $q_n \pmod{m}$ with a fixed modulus $m$, and more generally, the distribution of…

Given a network of fixed size $n$ and an initial distribution of data, we derive sufficient connectivity conditions on a sequence of time-varying digraphs for (a) data collection and (b) data dissemination, within at most $(n-1)$…

We give a construction of a real number that is normal to all integer bases and continued fraction normal. The computation of the first n digits of its continued fraction expansion performs in the order of n^4 mathematical operations. The…

Here, we give upper and lower bounds on the count of positive integers $n\le x$ dividing the $n$th term of a nondegenerate linearly recurrent sequence with simple roots.

A simple method to derive parametric analytical extensions of Benford's law for first digits of numerical data is proposed. Two generalized Benford distributions are considered, namely the two-sided power Benford distribution and the new…

Despite the fact that almost all real numbers are absolutely normal---that is, the digits in their expansions to any base occur in all possible configurations with the expected frequency---not one specific example of an absolutely normal…

Let $X_1,X_2,...$ be the digits in the base-$q$ expansion of a random variable $X$ defined on $[0,1)$ where $q\ge2$ is an integer. For $n=1,2,...$, we study the probability distribution $P_n$ of the (scaled) remainder…

The average value of log s(n)/n taken over the first N even integers is shown to converge to a constant lambda when N tends to infinity; moreover, the value of this constant is approximated and proven to be less than 0. Here s(n) sums the…

The Prime Numbers are well-known for their paradoxical stand regarding Benford's Law. On one hand they adamantly refuse to obey the law of Benford in the usual sense, namely that of a normal density of the proportion of primes with d as the…

Quite recently, in [8] the authoor of this paper considered the distribution of primes in the sequence $(S_n)$ whose $n$th term is defined as $S_n=\sum_{k=1}^{2n}p_k$, where $p_k$ is the $k$th prime. Some heuristic arguments and the…