Related papers: Distribution of Nonzero Digits in a Greedy Sequenc…
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…
The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when…
The decimal digits of $\pi$ are widely believed to behave like as statistically independent random variables taking the values $0, 1, 2, 3, 4, 5$, $6, 7, 8, 9$ with equal probabilities $1/10$. In this article, first, another similar…
The \textit{ternary digits of $2^n$} are a finite sequence of 0s, 1s, and 2s. It is a natural question to ask whether the frequency of any string of 0s, 1s, and 2s in this sequence approaches the same limit for all strings of the same…
Let s_q(n) denote the base q sum of digits function, which for n<x, is centered around (q-1)/2 log_q x. In Drmota, Mauduit and Rivat's 2009 paper, they look at sum of digits of prime numbers, and provide asymptotics for the size of the set…
Let $b \ge 2$ be an integer. Not much is known on the representation in base $b$ of prime numbers or of numbers whose prime factors belong to a given, finite set. Among other results, we establish that any sufficiently large integer which…
Let $s_2$ be the sum-of-digits function in base $2$, which returns the number of non-zero binary digits of a nonnegative integer $n$. We study $s_2$ alon g arithmetic subsequences and show that --- up to a shift --- the set of $m$-tuples of…
In a multi-base representation of an integer (in contrast to, for example, the binary or decimal representation) the base (or radix) is replaced by products of powers of single bases. The resulting numeral system has desirable properties…
In this paper we consider integers in base 10 like $abc$, where $a$, $b$, $c$ are digits of the integer, such that $abc^2 - (abc \cdot cba) \; = \; \pm n^2$, where $n$ is a positive integer, as well as equations $abc^2 - (abc \cdot cba) \;…
We show any power of five may be expressed arithmetically with the digits of its decimal representation. We also show powers of five (in decimal) contain any amount of zeros in a row.
In the paper, I consider appearance of unit's digits in minor totals of a few integer sequences. The sequences include the sequence of even integers, sequence of odd integers and Faulhaber polynomial at $p = 2$. Application of difference…
This paper focuses on greedy expansions, one possible representation of numbers, and on arithmetical operations with them. Performing addition or multiplication some additional digits can appear. We study bounds on the number of such digits…
We give an elementary proof that the sum of the digits of $2^n$ in base 10 is greater than $\log_4 n$. In particular, the limit of the sum of digits of $2^n$ is infinite.
In this paper we study the sequences defined by the last and the last non-zero digits of $n^n$ in base $b$. For the sequence given by the last digits of $n^n$ in base $b$, we prove its periodicity using different techniques than those used…
In this paper we study the sequence of strings of $k$ last nonzero digits of $n!$ in a given base $b$. We determine for which $b$ this sequence is automatic and show how to generate it using a uniform morphism. We also compute how often…
We investigate the topological structure of the decimal expansions of the three famous naturally occurring irrational numbers, $\pi$, $e$, and golden ratio, by explicitly calculating the diversity of the pair distributions of the ten digits…
We create a simple test for distinguishing between sets of primes and random numbers using just the sum-of-digits function. We find that the sum-of-the-digits of prime numbers does not have an equal probability of being odd or even. The…
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…
We prove Bombieri-Vinogradov type theorems for primes with a missing digit in their $b$-adic expansion for some large positive integer $b$. The proof is based on the circle method, which relies on the Fourier structure of the integers with…
We study the problem of finding positive integers $n$ such that all the decimal digits of $2^n$ are even, i.e., belong to $\{0, 2, 4, 6, 8\}$. Computational checks up to $n = 10^{15}$ reveal the known cases $n = 1, 2, 3, 6, 11$ and no…