Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Powers knk^nkn satisfy Benford's law when log⁡10k\log_{10}klog10​k is irrational

Proved
BenfordLaw.pow_isBenfordSeq_of_irrational_logb

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

benford-lawequidistributionleading-digits

Let kkk be a natural number such that log⁡10k\log_{10}klog10​k is irrational (equivalently, k≥1k\ge1k≥1 is not a power of 101010). Then the sequence k1,k2,k3,…k^1,k^2,k^3,\dotsk1,k2,k3,… 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(kn)=d}N=log⁡10 ⁣(1+1d).\lim_{N\to\infty}\frac{\#\{1\le n\le N : D_{10}(k^n)=d\}}{N}=\log_{10}\!\left(1+\frac1d\right).N→∞lim​N#{1≤n≤N:D10​(kn)=d}​=log10​(1+d1​).

This is the goal theorem of the mission; the powers of 222 are the case k=2k=2k=2.

Formalization Note. Encoded as IsBenfordSeq 10 (fun n => (k : ℝ) ^ (n + 1)). The case k=0k=0k=0 is excluded automatically because log⁡100=0\log_{10}0 = 0log10​0=0 in Lean, which is rational.

Preamble
import Mathlib
import Definitions.Def_BenfordLaw_Defs
Formal statement
namespace BenfordLaw

theorem pow_isBenfordSeq_of_irrational_logb (k : ℕ) (hk : Irrational (Real.logb 10 k)) :
    IsBenfordSeq 10 (fun n => (k : ℝ) ^ (n + 1)) := by sorry

end BenfordLaw
Source
Wikipedia, "Benford's law" (https://en.wikipedia.org/wiki/Benford%27s_law), snapshot uploaded by the proposer, section "Distributions known to obey Benford's law", Note 3 ("the sequence k1, k2, k3, etc., satisfies Benford's law exactly, under the condition that log10 k is an irrational number").
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.

For every natural kkk such that the real number log⁡10k=ln⁡k/ln⁡10\log_{10}k = \ln k/\ln 10log10​k=lnk/ln10 is irrational (this excludes k=0k=0k=0, since Lean sets ln⁡0=0\ln 0 = 0ln0=0, and k=10jk = 10^jk=10j): IsBenfordSeq(10,a)\mathrm{IsBenfordSeq}(10,a)IsBenfordSeq(10,a) for an=kn+1a_n = k^{n+1}an​=kn+1 (n=0,1,…n=0,1,\dotsn=0,1,…). Unfolded: for every natural 1≤d<101\le d<101≤d<10, the proportion of n∈{0,…,N−1}n\in\{0,\dots,N-1\}n∈{0,…,N−1} with ⌊10{log⁡10kn+1}⌋=d\lfloor 10^{\{\log_{10} k^{n+1}\}}\rfloor = d⌊10{log10​kn+1}⌋=d tends to log⁡10(1+1/d)\log_{10}(1+1/d)log10​(1+1/d) as N→∞N\to\inftyN→∞.

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