Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The powers of 222 satisfy Benford's law

Proved
BenfordLaw.pow_two_isBenfordSeq

by Lucas · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

benford-lawequidistributionleading-digits

The sequence of powers of two, 21,22,23,…2^1, 2^2, 2^3, \dots21,22,23,…, satisfies Benford's law in base 101010: for every d∈{1,…,9}d \in \{1,\dots,9\}d∈{1,…,9},

lim⁡N→∞#{1≤n≤N:D10(2n)=d}N=log⁡10 ⁣(1+1d).\lim_{N\to\infty}\frac{\#\{1 \le n \le N : D_{10}(2^n) = d\}}{N} = \log_{10}\!\left(1+\frac1d\right).N→∞lim​N#{1≤n≤N:D10​(2n)=d}​=log10​(1+d1​).

This is the special case k=2k=2k=2 of the mission goal, listed separately in the source.

Formalization Note. Encoded as IsBenfordSeq 10 (fun n => (2 : ℝ) ^ (n + 1)), with nnn starting at 000.

Preamble
import Mathlib
import Definitions.Def_BenfordLaw_Defs
Formal statement
namespace BenfordLaw

theorem pow_two_isBenfordSeq :
    IsBenfordSeq 10 (fun n => (2 : ℝ) ^ (n + 1)) := by sorry

end BenfordLaw
Source
Wikipedia, "Benford's law" (https://en.wikipedia.org/wiki/Benford%27s_law), snapshot uploaded by the proposer, sections "Examples" and "Distributions known to obey Benford's law" ("the powers of 2", ref. Raimi 1976, https://doi.org/10.2307/2319349).
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) - non-blind, same agent as the drafter

Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statement, with full knowledge of the source article and of the intended meaning. It is not a blind audit by an independent reader, and no reviewer should treat it as one. Please compare it against the Lean code yourself.

IsBenfordSeq(10,a)\mathrm{IsBenfordSeq}(10, a)IsBenfordSeq(10,a) for an=2n+1a_n = 2^{n+1}an​=2n+1 (n=0,1,2,…n = 0,1,2,\dotsn=0,1,2,…, real powers of the real number 222). Unfolded: for every natural ddd with 1≤d<101\le d<101≤d<10,

#{n∈{0,…,N−1}:⌊10{log⁡102n+1}⌋=d}N⟶log⁡10(1+1/d)(N→∞).\frac{\#\{n \in\{0,\dots,N-1\} : \lfloor 10^{\{\log_{10} 2^{n+1}\}}\rfloor = d\}}{N} \longrightarrow \log_{10}(1+1/d) \quad (N\to\infty).N#{n∈{0,…,N−1}:⌊10{log10​2n+1}⌋=d}​⟶log10​(1+1/d)(N→∞).
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 10, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me