Dirichlet, Sierpiński, and Benford
A theorem of \textit{W. Sierpiński} [Acta Arith. 5, 265--266 (1959; Zbl 0094.25505)] says that if \(g\ge 2\), and if positive integers \(A\) and \(B\) are given, with \((B,g)=1\), then there are infinitely many primes whose expansion in base \(g\) begins with the digits of \(A\) and ends with the digits of \(B\). The first result in the paper extends this to a coprime pair of bases \(g,g'\). Given positive integers \(A,A',B,B'\) with \((B,g)=(B',g')=1\), there are infinitely many primes whose base \(g\) expansion begins with the digits of \(A\) and ends with the digits of \(B\) (to base \(g\)), and whose base \(g'\) expansion begins with the digits of \(A'\) and ends with the digits of \(B'\) (to base \(g'\)). Indeed it is shown that such primes have Dirichlet density \[ \frac{1}{\phi(g^{\ell})\phi(g'^{\ell'})} \frac{\log(1+1/A)}{\log g}\frac{\log(1+1/A')}{\log g'}, \] where \(A\) has \(\ell\) digits to base \(g\) and \(A'\) has \(\ell'\) digits to base \(g'\). The authors discuss variants in which the condition \((g,g')=1\) is weakened, and in which one has 3 or more bases. The appearance of \(\log(1+1/A)/\log g\) relates to Benford's Law, and the final section of the paper investigates this further. It is shown that the sequences of values of \(\phi(n)\), of \(\sigma(n)\), and of \(d(n)\), are each ``logarithmically Benford, so that, for example, the logarithmic density of integers \(n\) for which the base-10 expansion of \(\phi(n)\) begins with the digit \(A\), is \(\log(1+1/A)/\log 10\) for \(1\le A\le 9\).
- Distribution of leading digits of numbers
- scientific article; zbMATH DE number 4019143
- On the first digits of the Fibonacci numbers and their Euler function
- Prime numbers and the first digit phenomenon
- On digital distribution in some integer sequences
- scientific article; zbMATH DE number 4045821
- scientific article; zbMATH DE number 3983301
- Benford's law, recurrence relations and equidistributed series
- scientific article; zbMATH DE number 3875405
- An introduction to Benford's law
- An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
- Benford's law for coefficients of modular forms and partition functions
- Benford's law. Theory and applications
- Fast growing sequences of numbers and the first digit phenomenon
- Geometric and analytic number theory. Transl. from the German by Rudolf Taschner
- scientific article; zbMATH DE number 4012703 (Why is no real title available?)
- scientific article; zbMATH DE number 473229 (Why is no real title available?)
- scientific article; zbMATH DE number 3404329 (Why is no real title available?)
- scientific article; zbMATH DE number 3067768 (Why is no real title available?)
- Initial Digits for the Sequence of Primes
- Number theory, Fourier analysis and geometric discrepancy
- Prescribing the binary digits of primes
- Prescribing the binary digits of primes. II
- Pretentiousness in analytic number theory
- Prime numbers with a positive proportion of preassigned digits
- Primes with preassigned digits
- Primes with preassigned digits II
- Simple Analytic Proof of the Prime Number Theorem
- Sur les nombres premiers ayant des chiffres initiaux et finals donnés
- The distribution of leading digits and uniform distribution mod 1
- The mantissa distribution of the primorial numbers
This page was built for publication: Dirichlet, Sierpiński, and Benford
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2672008)