Dropbear said:
A couple of pi questions.
1. Has any study been made on the decimal representation of pi to see if any number occurs more often than any number?
Certainly. People have been looking for such patterns throughout history. Of course, they didn’t have much material to work with before the computer era. I’m not sure what the current record is, but according to Wikipedia 10 trillion (10<SUP>13</SUP>) digits of π were calculated in 2011 by Alexander Yee and Shigeru Kondo. Some cute patterns have been found, but nothing that significantly deviates from statistical expectations.
It’s long been conjectured that π is a normal number , i.e., all possible digit sub-sequences occur with the frequency one would expect from a purely random sequence. But nobody knows how to prove this conjecture. FWIW, if a number is normal in any base it’s normal in all (finite integer) bases. Examining finite sequences of digits may shed some light on this matter, and I guess that if a significant deviation from normalcy were discovered, that might lead to a proof that π isn’t normal; OTOH, even 10 trillion digits is a drop in the bucket compared to infinity. :)
A famous sequence that occurs relatively early in the digits of π is the Feynmann point,
Wiki said:
a sequence of six 9s that begins at the 762nd decimal place of the decimal representation of π. It is named after physicist Richard Feynman, who once stated during a lecture he would like to memorize the digits of π until that point, so he could recite them and quip “nine nine nine nine nine nine and so on”, suggesting, in a tongue-in-cheek manner, that π is rational.
See http://en.wikipedia.org/wiki/Feynman_point
Dropbear said:
2. If the decimal representation of pi is not random – can it be calculated how long it takes to find a string of n numbers long within that representation?
Well, in the absence of evidence to the contrary, we can pretend that it’s normal and use standard statistical techniques to estimate the probability of finding a substring of length n within the first m digits.
If you want to find digit sequences in π, check out the Pi Searcher , by David G. Andersen.
I ought to mention that it’s possible to calculate hexadecimal digits of π without having to calculate all the preceding hex digits, using spigot algorithms . It’s easy to use the algorithms to get individual bits of π, but unfortunately nobody’s come up with a decimal version yet. Still, they’re useful for checking the results of other algorithms, since it’s relatively easy to convert a long decimal number to hex.