Benford law Created 2026-10-05 Updated 2026-10-14
For a positive random variable , let be its first nonzero base-ten digit. The Benford law is the discrete probability distribution with probability mass functionHere need not be an integer: , and all have . Multiplication by an integer power of ten changes the decimal point's position and leaves the first nonzero digit unchanged. Zero has no first nonzero digit, so exclude it. For negative inputs one may explicitly use their absolute values, still excluding zero; that convention must be stated rather than applying a logarithm to a negative number.
The Benford law favors small digits: , whereas . Thus the model assigns about to digit one and to digit nine. The masses are positive and their normalization is a finite telescoping series:
Why can digit one be so common? In a decimal significand interval , the digit-one region occupies a larger fraction of the logarithmic scale than the digit-nine region . The precise assumption is that the fractional part of the base-ten logarithm is distributed uniformly on ; Benford law from logarithmic uniformity turns those unequal interval lengths into probabilities. This makes a surprising digit pattern into a simple geometry of multiplicative size. The logarithmic explanation is also presented in Peter Sheridan Dodds, Benford's Law, essential story.
The Benford law is useful as a proposed model for leading digits when the mechanism supports logarithmic uniformity or an appropriate limiting argument, such as Benford frequencies for powers of an integer. Merely spanning many powers of ten does not establish that assumption. A discrepancy from the Benford law can prompt investigation of the model and data collection; by itself it does not establish fraud, and agreement does not establish authenticity.
Simon Newcomb's 1881 paper, Note on the Frequency of Use of the Different Digits in Natural Numbers, appeared in the American Journal of Mathematics 4, pp. 39–40. Its opening connects unequal leading-digit frequencies with the faster wear of early pages in logarithm tables. The publication metadata and original opening excerpt are available in Newcomb (1881), original publication record and [ref]
https://www.benfordonline.net/fullreference/414. Newcomb (1881), reproduced opening excerpt
. Frank Benford's The Law of Anomalous Numbers, Proceedings of the American Philosophical Society 78 (1938), pp. 551–572, likewise discusses worn logarithm tables on p. 551 and tabulates observations on p. 553. See Benford (1938), transcription of the original paper with page numbers and publication metadata. These observations motivated study of the digit pattern; they do not make the Benford law universal. Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 108 1 Solution Created 2026-10-03 Updated 2026-10-05
A continuous transformation of a compact metric space is uniquely ergodic when there is exactly one -invariant Borel probability measure on . We use the usual compact-space convention for unique ergodicity; the compactness and continuity hypotheses matter in the assertion about all starting points.
Let on the circle group, with irrational. Normalized Lebesgue measure is invariant under this irrational rotation of the circle. If is any invariant Borel probability measure, define its Fourier coefficients by . Invariance givesFor , irrationality makes , so ; also . These are the Fourier coefficients of . Hence and have the same integrals against every trigonometric polynomial. Such polynomials are uniformly dense in the continuous functions by the Stone-Weierstrass theorem, so the measures agree on every continuous test function and therefore agree as Borel measures. Thus
For the general uniquely ergodic system, fix and form the empirical measuresOn a compact metric space, the Borel probability measures are compact for weak convergence of probability measures. Any subsequential limit is invariant: for every continuous ,Here is bounded and is continuous, so the identity passes to the limit. Uniqueness of the invariant Borel probability measure gives . Every subsequential limit is therefore , and compactness implies convergence of the entire sequence. Testing against provesIn fact this proves uniform ergodic convergence for uniquely ergodic systems: if convergence were not uniform in , choose and where the discrepancy stays above a fixed positive number. The same compactness and telescoping argument applied to forces a subsequence to converge to , a contradiction. This also makes clear why an almost-everywhere Birkhoff ergodic theorem alone would not establish the requested everywhere assertion. Without the compact-space hypothesis the assertion need not hold: on the discrete space , set and . The only invariant probability is , but the continuous bounded function which is zero at and one on the integer orbit has orbit average one there.
For the decimal application put . This is irrational: if with positive integers , then , contradicting unique prime factorization. Writing with and gives . Its leading decimal digit is seven exactly whenThe half-open upper endpoint correctly excludes powers whose leading digit is eight, including .
The indicator of is not continuous, so an extra step is needed. For any , choose continuous functions on the circle with and , by tapering in small neighbourhoods of the two endpoints. Applying the everywhere averaging result to these functions traps the lower and upper limits of the interval frequency between their integrals. Letting proves everywhere interval frequency under an irrational rotation. ConsequentlyThis is the leading-seven case of Benford frequencies for powers of an integer.
