[jemfinch]

This isn't true. Benford's law applies just as equally to ordinary, arithmetic growth as well. The reason Benford's law works is because a growing number spends as much time with "1" as its initial digit as it did traversing the entire previous order of magnitude. This is true true whether the growth is exponential or arithmetic or multiplicative.

[rudiger]

Arithmetic growth refers to the situation where a value increases by a constant number per period. Benford's Law applies in this case?

[jemfinch]

It sure does, that's why I said it did.

Consider a sequence increasing by 1 each period. Now pick a random number between 1 and 10000. Generate the sequence between 1 and your random number. It will approximately conform to Benford's law, modulo your ending number.

Benford's law is a property of growing numbers, not of any particular kind of growth.

[rudiger]

Linearly growing sequences don't follow Benford's law, but lower first digits (1, 2, 3) are still more probable than higher first digits (7, 8, 9) "most of the time", as you describe it.

You can test it here: http://www.mpi-inf.mpg.de/~fietzke/benford.html

[jules]

That is not true, you just happened to choose lucky starting numbers. For example consider this one: choose a number between 1 and 10000. Generate the sequence between 9000000 and 9000000+(your number). Everything starts with 9.

Benfords law applies only to exponential growth over a long timescale.

[rudiger]

It actually applies to more than just exponential growth. Fibonacci and factorial growth rates also follow Benford's Law.