benford's law: tables of logarithms, tax cheats, and the
TRANSCRIPT
![Page 1: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/1.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Benford’s Law: Tables of Logarithms, TaxCheats, and The Leading Digit
Phenomenon
Michelle Manes ([email protected])
9 September, 2008
1
![Page 2: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/2.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
History
(1881) Simon Newcomb publishes “Note on thefrequency of use of the different digits in naturalnumbers.” The world ignores it.
(1938) Frank Benford (unaware of Newcomb’s work,presumably) publishes “The law of anomalousnumbers.”
2
![Page 3: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/3.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
History
(1881) Simon Newcomb publishes “Note on thefrequency of use of the different digits in naturalnumbers.” The world ignores it.
(1938) Frank Benford (unaware of Newcomb’s work,presumably) publishes “The law of anomalousnumbers.”
3
![Page 4: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/4.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Statement of Benford’s Law
Newcomb noticed that the early pages of the book oftables of logarithms were much dirtier than the laterpages, so were presumably referenced more often.
He stated the rule this way:
Prob(first significant digit = d) = log10
(1 +
1d
).
4
![Page 5: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/5.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Statement of Benford’s Law
Newcomb noticed that the early pages of the book oftables of logarithms were much dirtier than the laterpages, so were presumably referenced more often.
He stated the rule this way:
Prob(first significant digit = d) = log10
(1 +
1d
).
5
![Page 6: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/6.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Benford Distribution
DefinitionA sequence of positive numbers {xn} is Benford if
Prob(first significant digit = d) = log10
(1 +
1d
).
A sequence of positive numbers {xn} is Benford base b if
Prob(first significant digit = d) = logb
(1 +
1d
).
6
![Page 7: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/7.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Benford Distribution
DefinitionA sequence of positive numbers {xn} is Benford if
Prob(first significant digit = d) = log10
(1 +
1d
).
A sequence of positive numbers {xn} is Benford base b if
Prob(first significant digit = d) = logb
(1 +
1d
).
7
![Page 8: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/8.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Benford’s Law
Base 10 Predictionsdigit probability it occurs as a leading digit
1 30.1%2 17.6%3 12.5%4 9.7%5 7.9%6 6.7%7 5.8%8 5.1%9 4.6%
8
![Page 9: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/9.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Benford’s Data
9
![Page 10: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/10.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
More Data
Benford’s Law compared with: numbers from the frontpages of newspapers, U.S. county populations, and theDow Jones Industrial Average.
10
![Page 11: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/11.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Dow Illustrates Benford’s Law
Suppose the Dow Jones average is about $1,000. If theaverage goes up at a rate of about 20% a year, it wouldtake four years to get from 1 to 2 as a first digit.
If we start with a first digit 5, it only requires a 20%increase to get from $5,000 to $6,000, and that isachieved in one year.
When the Dow reaches $9,000, it takes only an 11%increase and just seven months to reach the $10,000mark. This again has first digit 1, so it will take anotherdoubling (and four more years) to get back to first digit 2.
11
![Page 12: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/12.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Dow Illustrates Benford’s Law
Suppose the Dow Jones average is about $1,000. If theaverage goes up at a rate of about 20% a year, it wouldtake four years to get from 1 to 2 as a first digit.
If we start with a first digit 5, it only requires a 20%increase to get from $5,000 to $6,000, and that isachieved in one year.
When the Dow reaches $9,000, it takes only an 11%increase and just seven months to reach the $10,000mark. This again has first digit 1, so it will take anotherdoubling (and four more years) to get back to first digit 2.
12
![Page 13: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/13.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Dow Illustrates Benford’s Law
Suppose the Dow Jones average is about $1,000. If theaverage goes up at a rate of about 20% a year, it wouldtake four years to get from 1 to 2 as a first digit.
If we start with a first digit 5, it only requires a 20%increase to get from $5,000 to $6,000, and that isachieved in one year.
When the Dow reaches $9,000, it takes only an 11%increase and just seven months to reach the $10,000mark. This again has first digit 1, so it will take anotherdoubling (and four more years) to get back to first digit 2.
13
![Page 14: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/14.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Dow Illustrates Benford’s Law
Suppose the Dow Jones average is about $1,000. If theaverage goes up at a rate of about 20% a year, it wouldtake four years to get from 1 to 2 as a first digit.
If we start with a first digit 5, it only requires a 20%increase to get from $5,000 to $6,000, and that isachieved in one year.
When the Dow reaches $9,000, it takes only an 11%increase and just seven months to reach the $10,000mark. This again has first digit 1, so it will take anotherdoubling (and four more years) to get back to first digit 2.
14
![Page 15: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/15.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Benford’s Law and Tax Fraud (Nigrini, 1992)
Most people can’t fake data convincingly.
Many states (including California) and the IRS now usefraud-detection software based on Benford’s Law.
15
![Page 16: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/16.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Benford’s Law and Tax Fraud (Nigrini, 1992)
Most people can’t fake data convincingly.
Many states (including California) and the IRS now usefraud-detection software based on Benford’s Law.
16
![Page 17: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/17.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Benford’s Law and Tax Fraud (Nigrini, 1992)
Most people can’t fake data convincingly.
Many states (including California) and the IRS now usefraud-detection software based on Benford’s Law.
17
![Page 18: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/18.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
True Life Tale
Manager from Arizona State Treasurer wasembezzling funds.
Most amounts were below $100,000 (criticalthreshold for checks that would require morescrutiny).Over 90% of the checks had a first digit 7, 8, or 9.(Trying to get close to the threshold without goingover — artificially changes the data and so breaks fitwith Benford’s law.)
18
![Page 19: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/19.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
True Life Tale
Manager from Arizona State Treasurer wasembezzling funds.Most amounts were below $100,000 (criticalthreshold for checks that would require morescrutiny).
Over 90% of the checks had a first digit 7, 8, or 9.(Trying to get close to the threshold without goingover — artificially changes the data and so breaks fitwith Benford’s law.)
19
![Page 20: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/20.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
True Life Tale
Manager from Arizona State Treasurer wasembezzling funds.Most amounts were below $100,000 (criticalthreshold for checks that would require morescrutiny).Over 90% of the checks had a first digit 7, 8, or 9.(Trying to get close to the threshold without goingover — artificially changes the data and so breaks fitwith Benford’s law.)
20
![Page 21: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/21.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
True Life Tale
21
![Page 22: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/22.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
What types of sequences are Benford?
Real-world data can be a good fit or not, depending onthe type of data. Data that is a good fit is “suitablyrandom” — comes in many different scales, and is a largeand randomly distributed data set, with no artificial orexternal limitations on the range of the numbers.
Some numerical sequences are clearly not Benford:1,2,3,4,5,6,7, . . . (uniform distribution)
1,10,100,1000, . . . (first digit is always 1)
22
![Page 23: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/23.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
What types of sequences are Benford?
Real-world data can be a good fit or not, depending onthe type of data. Data that is a good fit is “suitablyrandom” — comes in many different scales, and is a largeand randomly distributed data set, with no artificial orexternal limitations on the range of the numbers.
Some numerical sequences are clearly not Benford:
1,2,3,4,5,6,7, . . . (uniform distribution)
1,10,100,1000, . . . (first digit is always 1)
23
![Page 24: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/24.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
What types of sequences are Benford?
Real-world data can be a good fit or not, depending onthe type of data. Data that is a good fit is “suitablyrandom” — comes in many different scales, and is a largeand randomly distributed data set, with no artificial orexternal limitations on the range of the numbers.
Some numerical sequences are clearly not Benford:1,2,3,4,5,6,7, . . . (uniform distribution)
1,10,100,1000, . . . (first digit is always 1)
24
![Page 25: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/25.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
What types of sequences are Benford?
Real-world data can be a good fit or not, depending onthe type of data. Data that is a good fit is “suitablyrandom” — comes in many different scales, and is a largeand randomly distributed data set, with no artificial orexternal limitations on the range of the numbers.
Some numerical sequences are clearly not Benford:1,2,3,4,5,6,7, . . . (uniform distribution)
1,10,100,1000, . . . (first digit is always 1)
25
![Page 26: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/26.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Powers of Two
1,2,4,8,16,32,64, . . .
tn = 2n
26
![Page 27: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/27.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Powers of Two
1,2,4,8,16,32,64, . . .
tn = 2n
27
![Page 28: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/28.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Powers of Two
1,2,4,8,16,32,64, . . .
tn = 2n
28
![Page 29: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/29.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Powers of Two
29
![Page 30: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/30.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Fibonacci Numbers
1,1,2,3,5,8,13,21, . . .
Fn+1 = Fn + Fn−1
30
![Page 31: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/31.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Fibonacci Numbers
1,1,2,3,5,8,13,21, . . .
Fn+1 = Fn + Fn−1
31
![Page 32: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/32.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Fibonacci Numbers
1,1,2,3,5,8,13,21, . . .
Fn+1 = Fn + Fn−1
32
![Page 33: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/33.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Fibonacci Numbers
33
![Page 34: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/34.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Mantissa Function
DefinitionDefine the mantissa function
M : R+ → [1,10)
x 7→ r
where r is the unique number in [1,10) such thatx = r × 10n for some n ∈ Z.
In other words, write the number in scientific notation.
34
![Page 35: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/35.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Mantissa Function
DefinitionDefine the mantissa function
M : R+ → [1,10)
x 7→ r
where r is the unique number in [1,10) such thatx = r × 10n for some n ∈ Z.
In other words, write the number in scientific notation.
35
![Page 36: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/36.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Mantissa Function
DefinitionDefine the mantissa function
M : R+ → [1,10)
x 7→ r
where r is the unique number in [1,10) such thatx = r × 10n for some n ∈ Z.
ExamplesM(9,000,001) = 9.000001.M(0.01247) = 1.247.
36
![Page 37: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/37.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Logarithms and Benford’s Law
Fundamental EquivalenceData set {xi} is Benford if {yi} is equidistributed mod 1,where yi = log10 xi .
Proof:x = M(x) · 10k for some k ∈ Z.First digit of x is d iff d ≤ M(x) < d + 1.log10 d ≤ y < log10(d + 1), wherey = log10(M(x)) = log10 x mod 1.If the distribution is uniform (mod 1), then theprobability y is in this range is
log10(d+1)−log10(d) = log10
(d + 1
d
)= log10
(1 +
1d
).
37
![Page 38: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/38.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Logarithms and Benford’s Law
Fundamental EquivalenceData set {xi} is Benford if {yi} is equidistributed mod 1,where yi = log10 xi .
Proof:x = M(x) · 10k for some k ∈ Z.
First digit of x is d iff d ≤ M(x) < d + 1.log10 d ≤ y < log10(d + 1), wherey = log10(M(x)) = log10 x mod 1.If the distribution is uniform (mod 1), then theprobability y is in this range is
log10(d+1)−log10(d) = log10
(d + 1
d
)= log10
(1 +
1d
).
38
![Page 39: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/39.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Logarithms and Benford’s Law
Fundamental EquivalenceData set {xi} is Benford if {yi} is equidistributed mod 1,where yi = log10 xi .
Proof:x = M(x) · 10k for some k ∈ Z.First digit of x is d iff d ≤ M(x) < d + 1.
log10 d ≤ y < log10(d + 1), wherey = log10(M(x)) = log10 x mod 1.If the distribution is uniform (mod 1), then theprobability y is in this range is
log10(d+1)−log10(d) = log10
(d + 1
d
)= log10
(1 +
1d
).
39
![Page 40: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/40.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Logarithms and Benford’s Law
Fundamental EquivalenceData set {xi} is Benford if {yi} is equidistributed mod 1,where yi = log10 xi .
Proof:x = M(x) · 10k for some k ∈ Z.First digit of x is d iff d ≤ M(x) < d + 1.log10 d ≤ y < log10(d + 1), wherey = log10(M(x)) = log10 x mod 1.
If the distribution is uniform (mod 1), then theprobability y is in this range is
log10(d+1)−log10(d) = log10
(d + 1
d
)= log10
(1 +
1d
).
40
![Page 41: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/41.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Logarithms and Benford’s Law
Fundamental EquivalenceData set {xi} is Benford if {yi} is equidistributed mod 1,where yi = log10 xi .
Proof:x = M(x) · 10k for some k ∈ Z.First digit of x is d iff d ≤ M(x) < d + 1.log10 d ≤ y < log10(d + 1), wherey = log10(M(x)) = log10 x mod 1.If the distribution is uniform (mod 1), then theprobability y is in this range is
log10(d+1)−log10(d) = log10
(d + 1
d
)= log10
(1 +
1d
).
41
![Page 42: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/42.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Logarithms and Benford’s Law
Fundamental EquivalenceData set {xi} is Benford if {yi} is equidistributed mod 1,where yi = log10 xi .
42
![Page 43: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/43.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Logarithms and Benford’s Law
Fundamental EquivalenceData set {xi} is Benford if {yi} is equidistributed mod 1,where yi = log10 xi .
0 1
1 102
log 2 ! log 10
43
![Page 44: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/44.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Logarithms and Benford’s Law
Fundamental EquivalenceData set {xi} is Benford if {yi} is equidistributed mod 1,where yi = log10 xi .
Kronecker-Weyl TheoremIf β 6∈ Q then nβ mod 1 is equidistributed.(Thus if log10 α 6∈ Q, then αn is Benford.)
44
![Page 45: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/45.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Powers of 2
TheoremThe sequence {2n} for n ≥ 0 is Benford.
Proof:Consider the sequence of logarithms {n(log10 2)}.By the Kronecker-Weyl Theorem, this is uniform(mod 1) because log10 2 6∈ Q.Since the sequence of logarithms is uniformlydistributed (mod 1), the original sequence isBenford.
45
![Page 46: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/46.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Powers of 2
TheoremThe sequence {2n} for n ≥ 0 is Benford.
Proof:Consider the sequence of logarithms {n(log10 2)}.By the Kronecker-Weyl Theorem, this is uniform(mod 1) because log10 2 6∈ Q.Since the sequence of logarithms is uniformlydistributed (mod 1), the original sequence isBenford.
46
![Page 47: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/47.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Fibonacci Numbers
TheoremThe sequence {Fn} of Fibonacci numbers is Benford.
Heuristic Argument:Closed form for Fibonacci numbers:
Fn =1√5
[(1 +√
52
)n
−
(1−√
52
)n].
∣∣∣(1−√
52
)∣∣∣ < 1, so the leading digits are completely
determined by 1√5
(1+√
52
)n.
This sequence is Benford because log10
(1+√
52
)6∈ Q.
47
![Page 48: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/48.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Fibonacci Numbers
TheoremThe sequence {Fn} of Fibonacci numbers is Benford.
Heuristic Argument:Closed form for Fibonacci numbers:
Fn =1√5
[(1 +√
52
)n
−
(1−√
52
)n].
∣∣∣(1−√
52
)∣∣∣ < 1, so the leading digits are completely
determined by 1√5
(1+√
52
)n.
This sequence is Benford because log10
(1+√
52
)6∈ Q.
48
![Page 49: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/49.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Fibonacci Numbers
TheoremThe sequence {Fn} of Fibonacci numbers is Benford.
Heuristic Argument:Closed form for Fibonacci numbers:
Fn =1√5
[(1 +√
52
)n
−
(1−√
52
)n].
∣∣∣(1−√
52
)∣∣∣ < 1, so the leading digits are completely
determined by 1√5
(1+√
52
)n.
This sequence is Benford because log10
(1+√
52
)6∈ Q.
49
![Page 50: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/50.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Fibonacci Numbers
TheoremThe sequence {Fn} of Fibonacci numbers is Benford.
Heuristic Argument:Closed form for Fibonacci numbers:
Fn =1√5
[(1 +√
52
)n
−
(1−√
52
)n].
∣∣∣(1−√
52
)∣∣∣ < 1, so the leading digits are completely
determined by 1√5
(1+√
52
)n.
This sequence is Benford because log10
(1+√
52
)6∈ Q.
50
![Page 51: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/51.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Linear Recurrence Sequences
Consider the sequence {an} given by some initialconditions a0,a1, . . . ,ak−1 and then a recurrence relation
an+k = c1an+k−1 + c2an+k−2 + · · ·+ ckan,
with c1, c2, . . . , ck fixed real numbers.
Find the eigenvalues of the recurrence relation and orderthem so that |λ1| ≥ |λ2| ≥ · · · ≥ |λk |.
There exist numbers u1,u2, . . . ,uk (which depend on theinitial conditions) so that an = u1λ
n1 + u2λ
n2 + · · ·+ ukλ
nk .
51
![Page 52: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/52.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Linear Recurrence Sequences
Consider the sequence {an} given by some initialconditions a0,a1, . . . ,ak−1 and then a recurrence relation
an+k = c1an+k−1 + c2an+k−2 + · · ·+ ckan,
with c1, c2, . . . , ck fixed real numbers.
Find the eigenvalues of the recurrence relation and orderthem so that |λ1| ≥ |λ2| ≥ · · · ≥ |λk |.
There exist numbers u1,u2, . . . ,uk (which depend on theinitial conditions) so that an = u1λ
n1 + u2λ
n2 + · · ·+ ukλ
nk .
52
![Page 53: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/53.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Linear Recurrence Sequences
Consider the sequence {an} given by some initialconditions a0,a1, . . . ,ak−1 and then a recurrence relation
an+k = c1an+k−1 + c2an+k−2 + · · ·+ ckan,
with c1, c2, . . . , ck fixed real numbers.
Find the eigenvalues of the recurrence relation and orderthem so that |λ1| ≥ |λ2| ≥ · · · ≥ |λk |.
There exist numbers u1,u2, . . . ,uk (which depend on theinitial conditions) so that an = u1λ
n1 + u2λ
n2 + · · ·+ ukλ
nk .
53
![Page 54: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/54.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Linear Recurrence Sequences
TheoremWith a linear recurrence sequence as described, iflog10 |λ1| 6∈ Qand the initial conditions are such thatu1 6= 0, then the sequence {an} is Benford.
Sketch of Proof:
Rewrite the closed form as an = u1λn1
(1 +O
(kuλn
2λn
1
))where u = maxi |ui |+ 1.Some clever algebra using our assumptions to findthat yn = log10(an) = n log10 λ1 + log10 u1 +O(βn) forsome appropriate β.Show in the limit the error term affects a vanishinglysmall portion of the distribution.
54
![Page 55: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/55.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Linear Recurrence Sequences
TheoremWith a linear recurrence sequence as described, iflog10 |λ1| 6∈ Qand the initial conditions are such thatu1 6= 0, then the sequence {an} is Benford.
Sketch of Proof:
Rewrite the closed form as an = u1λn1
(1 +O
(kuλn
2λn
1
))where u = maxi |ui |+ 1.
Some clever algebra using our assumptions to findthat yn = log10(an) = n log10 λ1 + log10 u1 +O(βn) forsome appropriate β.Show in the limit the error term affects a vanishinglysmall portion of the distribution.
55
![Page 56: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/56.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Linear Recurrence Sequences
TheoremWith a linear recurrence sequence as described, iflog10 |λ1| 6∈ Qand the initial conditions are such thatu1 6= 0, then the sequence {an} is Benford.
Sketch of Proof:
Rewrite the closed form as an = u1λn1
(1 +O
(kuλn
2λn
1
))where u = maxi |ui |+ 1.Some clever algebra using our assumptions to findthat yn = log10(an) = n log10 λ1 + log10 u1 +O(βn) forsome appropriate β.
Show in the limit the error term affects a vanishinglysmall portion of the distribution.
56
![Page 57: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/57.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Linear Recurrence Sequences
TheoremWith a linear recurrence sequence as described, iflog10 |λ1| 6∈ Qand the initial conditions are such thatu1 6= 0, then the sequence {an} is Benford.
Sketch of Proof:
Rewrite the closed form as an = u1λn1
(1 +O
(kuλn
2λn
1
))where u = maxi |ui |+ 1.Some clever algebra using our assumptions to findthat yn = log10(an) = n log10 λ1 + log10 u1 +O(βn) forsome appropriate β.Show in the limit the error term affects a vanishinglysmall portion of the distribution.
57
![Page 58: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/58.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Elliptic Divisibility Sequences
DefinitionAn integral divisibility sequence is a sequence of integers{un} satisfying
un | um whenever n | m.
An elliptic divisibility sequence is an integral divisibilitysequence which satisfies the following recurrence relationfor all m ≥ n ≥ 1:
um+num−nu21
= um+1um−1u2n − un+1un−1u2
m.
58
![Page 59: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/59.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Boring Elliptic Divisibility Sequences
The sequences of integers, where un = n.
The sequence 0,1,−1,0,1,−1, . . ..
The sequence1,3,8,21,55,144,377,987,2584,6765, . . . (this isevery-other Fibonacci number).
59
![Page 60: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/60.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Boring Elliptic Divisibility Sequences
The sequences of integers, where un = n.
The sequence 0,1,−1,0,1,−1, . . ..
The sequence1,3,8,21,55,144,377,987,2584,6765, . . . (this isevery-other Fibonacci number).
60
![Page 61: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/61.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Boring Elliptic Divisibility Sequences
The sequences of integers, where un = n.
The sequence 0,1,−1,0,1,−1, . . ..
The sequence1,3,8,21,55,144,377,987,2584,6765, . . . (this isevery-other Fibonacci number).
61
![Page 62: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/62.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Not-So-Boring Elliptic Divisibility Sequences
The sequences which begins0,1,1,−1,1,2,−1,−3,−5,7,−4,−28,29,59,129,−314,−65,1529,−3689,−8209,−16264,833313,113689,−620297,2382785,7869898,7001471,−126742987,−398035821,168705471, . . .(This is sequence A006769 in the On-LineEncyclopedia of Integer Sequences.)
The sequence which begins1,1,−3,11,38,249,−2357,8767,496036,−3769372,−299154043,−12064147359, . . ..
62
![Page 63: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/63.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Not-So-Boring Elliptic Divisibility Sequences
The sequences which begins0,1,1,−1,1,2,−1,−3,−5,7,−4,−28,29,59,129,−314,−65,1529,−3689,−8209,−16264,833313,113689,−620297,2382785,7869898,7001471,−126742987,−398035821,168705471, . . .(This is sequence A006769 in the On-LineEncyclopedia of Integer Sequences.)
The sequence which begins1,1,−3,11,38,249,−2357,8767,496036,−3769372,−299154043,−12064147359, . . ..
63
![Page 64: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/64.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Why We Like Elliptic Divisibility Sequences
Special case of Somos sequences, which areinteresting and an active area of research.
Connection to elliptic curves, also an active area ofresearch.
Elliptic curve
E over Qwith rational point
P on E
↔ EDS: denominators
of the sequenceof points {P,2P,3P, . . .}
Applications to elliptic curve cryptography.
64
![Page 65: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/65.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Why We Like Elliptic Divisibility Sequences
Special case of Somos sequences, which areinteresting and an active area of research.
Connection to elliptic curves, also an active area ofresearch.
Elliptic curve
E over Qwith rational point
P on E
↔ EDS: denominators
of the sequenceof points {P,2P,3P, . . .}
Applications to elliptic curve cryptography.
65
![Page 66: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/66.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Why We Like Elliptic Divisibility Sequences
Special case of Somos sequences, which areinteresting and an active area of research.
Connection to elliptic curves, also an active area ofresearch.
Elliptic curve
E over Qwith rational point
P on E
↔ EDS: denominators
of the sequenceof points {P,2P,3P, . . .}
Applications to elliptic curve cryptography.66
![Page 67: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/67.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Elliptic Divisibility Sequences are Benford?
67
![Page 68: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/68.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Elliptic Divisibility Sequences are Benford?
68
![Page 69: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/69.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Elliptic Divisibility Sequences are Benford?
69
![Page 70: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/70.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Heuristic Argument
It’s well-known that elliptic divisibility sequencessatisfy a growth condition like un ≈ cn2 where theconstant c depends on the arithmetic height of thepoint P and on the curve E .
Weyl’s theorem tells us that {nkα} is uniformdistributed (mod 1) iff α 6∈ Q.
So we should at least be able to conclude that a givenEDS is Benford base b for almost every b.
But: The argument with the big-O error terms isdelicate, and not enough is known in the case of EDS.
70
![Page 71: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/71.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Heuristic Argument
It’s well-known that elliptic divisibility sequencessatisfy a growth condition like un ≈ cn2 where theconstant c depends on the arithmetic height of thepoint P and on the curve E .
Weyl’s theorem tells us that {nkα} is uniformdistributed (mod 1) iff α 6∈ Q.
So we should at least be able to conclude that a givenEDS is Benford base b for almost every b.
But: The argument with the big-O error terms isdelicate, and not enough is known in the case of EDS.
71
![Page 72: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/72.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Heuristic Argument
It’s well-known that elliptic divisibility sequencessatisfy a growth condition like un ≈ cn2 where theconstant c depends on the arithmetic height of thepoint P and on the curve E .
Weyl’s theorem tells us that {nkα} is uniformdistributed (mod 1) iff α 6∈ Q.
So we should at least be able to conclude that a givenEDS is Benford base b for almost every b.
But: The argument with the big-O error terms isdelicate, and not enough is known in the case of EDS.
72
![Page 73: Benford's Law: Tables of Logarithms, Tax Cheats, and The](https://reader034.vdocuments.us/reader034/viewer/2022042501/62617e2d96aa0026a60e270b/html5/thumbnails/73.jpg)
History Applications Benford and Integer Sequences Formalism Benford and Recurrence Relations
Heuristic Argument
It’s well-known that elliptic divisibility sequencessatisfy a growth condition like un ≈ cn2 where theconstant c depends on the arithmetic height of thepoint P and on the curve E .
Weyl’s theorem tells us that {nkα} is uniformdistributed (mod 1) iff α 6∈ Q.
So we should at least be able to conclude that a givenEDS is Benford base b for almost every b.
But: The argument with the big-O error terms isdelicate, and not enough is known in the case of EDS.
73