Copyright ©2003 by Paul Niquette. All rights reserved.
astonishing factoid about numbers is that the decimal ciphers are not equally
represented among the most significant digits (see Benford's
Law). The bar-chart below summarizes the percentages of readily
computed integers in which each decimal cipher appears as the most significant
The bars represent the percentages enjoyed by each decimal cipher as the most significant digit in populations of 90 computed integers (as indexed from n = 0, 1, 2, ... 89). What the heck is going on with those factorials?
n going all the way from n = 1 to n = 89, wherein...
89! = 16,507,955,160,908,461,081,216,919,262,453,619,...the cipher does not appear even once as the most significant digit.
Factorials are simply the products of consecutive integers, 1 times 2 times 3 times... up to some number n symbolized as n! That's not an exclamatory statement. The "!" was introduced in the early 19th century by the mathematician Christian Kamp and is pronounced "factorial." By the way, expansion of n! is most often put the other way around: n! = n(n - 1)(n - 2)(n - 3)...3, 2, 1. A "factoid" is something else.
Factorials do become humongous fast. Consider the number of possible sequences you can deal after shuffling a deck of cards...
52! = 80,658,175,170,943,878,571,660,636,856,403,...that's 8 bidecabillion permutations. Moreover, to reach a googol, all you need is a mere 70!
Meanwhile, however huge n! gets, it does
to get a most significant digit of as shown above.