Add to ORKGBenford's Law describes the prevalence of small numbers as the leading digits of numbers in many sets of integers. We prove a variant of Benford's law for many positive-density subsets of the primes. This follows from a more general result over number fields.Comment: 6 page
Let $k \geq 2$ and $b \geq 3$ be integers, and suppose that $d_1, d_2 \in \{0,1,\dots, b - 1\}$ are ...
AbstractThe number defined by the title is denoted by Ψ(x, y). Let u = log xlog y and let ϱ(u) be th...
Motivated by recently developed interest to the distribution of $q$-arydigits of Mersenne numbers $M...
Benford's Law describes the prevalence of small numbers as the leading digits of numbers in many set...
In the literature, Benford's Law is considered for base-b expansions where b>1 is an integer. In thi...
Benford's law is an empirical "law'' governing the frequency of leading digits in numerical data set...
In this paper, we will see that the proportion of d as p^th digit, where p>1 and d in [[0,9]], in...
Many distributions for first digits of integer sequences are not Benford. A simple method to derive ...
My Poster is on the history and application of Benford’s law. This is a law that states that the lea...
The Bombieri-Vinogradov theorem for nilsequences, Discrete Analysis 2021:21, 55 pp. The prime numb...
My Poster is on the history and application of Benford’s law. This is a law that states that the lea...
In 2020, Roger Baker \cite{Bak} proved a result on the exceptional set of moduli in the prime number...
We relate the size of the error term in the Hardy-Littlewood conjectured formula for the number of p...
AbstractIn this paper we modify the usual sieve methods to study the distribution of almost primes i...
This short note provides a sharper upper bound of a well known inequality for the sum of divisors fu...
Let $k \geq 2$ and $b \geq 3$ be integers, and suppose that $d_1, d_2 \in \{0,1,\dots, b - 1\}$ are ...
AbstractThe number defined by the title is denoted by Ψ(x, y). Let u = log xlog y and let ϱ(u) be th...
Motivated by recently developed interest to the distribution of $q$-arydigits of Mersenne numbers $M...
Benford's Law describes the prevalence of small numbers as the leading digits of numbers in many set...
In the literature, Benford's Law is considered for base-b expansions where b>1 is an integer. In thi...
Benford's law is an empirical "law'' governing the frequency of leading digits in numerical data set...
In this paper, we will see that the proportion of d as p^th digit, where p>1 and d in [[0,9]], in...
Many distributions for first digits of integer sequences are not Benford. A simple method to derive ...
My Poster is on the history and application of Benford’s law. This is a law that states that the lea...
The Bombieri-Vinogradov theorem for nilsequences, Discrete Analysis 2021:21, 55 pp. The prime numb...
My Poster is on the history and application of Benford’s law. This is a law that states that the lea...
In 2020, Roger Baker \cite{Bak} proved a result on the exceptional set of moduli in the prime number...
We relate the size of the error term in the Hardy-Littlewood conjectured formula for the number of p...
AbstractIn this paper we modify the usual sieve methods to study the distribution of almost primes i...
This short note provides a sharper upper bound of a well known inequality for the sum of divisors fu...
Let $k \geq 2$ and $b \geq 3$ be integers, and suppose that $d_1, d_2 \in \{0,1,\dots, b - 1\}$ are ...
AbstractThe number defined by the title is denoted by Ψ(x, y). Let u = log xlog y and let ϱ(u) be th...
Motivated by recently developed interest to the distribution of $q$-arydigits of Mersenne numbers $M...