Abstract

Benford's law is an empirical ``law'' governing the frequency of leading digits in numerical data sets. Surprisingly, for mathematical sequences the predictions derived from it can be uncannily accurate. For example, among the first billion powers of 22, exactly 301029995301029995 begin with digit 1, while the Benford prediction for this count is 109log⁡102=301029995.66…10^9\log_{10}2=301029995.66\dots. Similar ``perfect hits'' can be observed in other instances, such as the digit 11 and 22 counts for the first billion powers of 33. We prove results that explain many, but not all, of these surprising accuracies, and we relate the observed behavior to classical results in Diophantine approximation as well as recent deep conjectures in this area.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.