1
$\begingroup$

I was told that the digits of $\pi$ are random (or at least nearly so). Would $\pi$/2 etc. also have that property? Which other numbers have that property? In case there are a vast number of them, do they have some common properties such that one could computationally randomly pick one out of a class of such numbers for use? If one combines two such numbers digitwise $\mod 10$, is it always true that the result can only be better random and never worse?

  • 2
    Actually, those numbers that are most easily proved to be base-10 _normal_ (like [Champernowne's constant](http://en.wikipedia.org/wiki/Champernowne_constant)) are far from what one might really call _random_ ...2012-09-27

3 Answers 3

5

$\pi$ is conjectured to be a normal number, which means that all digits and all combinations of digits appear just as often as you'd expect if you were choosing digits randomly, at least asymptotically. Almost all numbers share this property, though it's hard to prove that a given number has it. Numbers known to be non-normal include rational numbers.

  • 0
    I think transcendental numbers like pi and even other irrational number appear to be "normal". I don't know how you could really show it though since it is a matter of looking at an infinite sequence. Rational numbers are know not to be normal because for example 1/3 is just the repeating decimal number 0.3333333333... Other rationals will eventually repeat destroying any chance to be normal.2012-09-27
2

On your final question

If one combines two such numbers digitwise mod 10, is it always true that the result can only be better random and never worse?

the answer is no if combining digitwise means interleaving: if $\pi$ has random digits then so too does $10-\pi \approx 6.858407\ldots$, but their combination is decidely not random in that you can predict half the digitis from the previous digits.

1

The digits of $\pi$ are, of course, deterministic and so not random. But looking only at the digits, they are nonrandom in an important sense: they have low Kolmogorov complexity. There are short algorithms that can (given enough time) generate as many digits of $\pi$ as desired, and so the digits of $\pi$ are highly compressible: instead of writing out the first billion digits, taking on the order of a billion bytes, you can write a program for generating pi to a given number of digits (taking a few kilobytes) and then the number one billion, taking a few additional bytes. Truly random numbers cannot be compressed in this fashion.