On 2014-11-02, Matti Nykyri <matti.nyk...@iki.fi> wrote: >> On Nov 1, 2014, at 23:56, David W Noon <dwn...@ntlworld.com> wrote: >> >> -----BEGIN PGP SIGNED MESSAGE----- >> Hash: SHA1 >> >> On Sat, 01 Nov 2014 22:47:15 +0200, Alan Mckinnon >> (alan.mckin...@gmail.com) wrote about "Re: [gentoo-user] Re: OT Best >> way to compress files with digits" (in <545546d3.3030...@gmail.com>): >> >>> On 01/11/2014 19:59, meino.cra...@gmx.de wrote: >> [snip] >>>> Ah! By the way...I was astonished to read, that the digits of PI >>>> are called random on the one hand and on the other hand there is >>>> a formula [1] to calculate a certain digit of PI without >>>> calculation of the previous digits... Calculated random? Are >>>> nature constants the purest form of PRNGs ??? ;) (Quantum physics >>>> is everywhere... ;;)) >>>> >>>> [1]: >>>> http://en.wikipedia.org/wiki/Bailey%E2%80%93Borwein%E2%80%93Plouffe_formula >>> >>> >>> The sequence of digits that make up pi are a random sequence - you >>> can analyze the order any way you want and you'll find no inherent >>> pattern. >> >> Actually, the sequence of digits is most definitely *not* random. If >> the sequence of digits is written any other way then the value is not >> Pi. Hence the sequence is unique, not random. >> >> I think what you are grasping for is that the frequency of distinct >> digits tends to be uniform: 0's occur as often as 1's as often ... as >> 9's. Note that the "as often as" operator is really approximate for
> Well all the digit of pi can be compressed to the following: > >=pi(); Nah. Just switch to base-Pi, and then it compresses to: 1 -- Grant Edwards grant.b.edwards Yow! Are we THERE yet? at gmail.com