Bibliographic Information
 Other Title

 The number p as a pseudo random number generator
Search this article
Description
The random numbers, as actually realized sequences of the random variable with mutually independent and same distribution function, are applied in many fields of science and technology. The random number sequence which a computer generates is called pseudorandom numbers (PRNs). Various codes for PRN generation have been developed and applied. Some known algorithms, e.g., the linear congruence method, have been reported often to exhibit some faults, in particular, in parallel computation environments. The mathematical constant pi is expected that its decimal expression gives a sequence of random numbers. Up to now, pi is calculated of more than a trillion digits. More precisely, 1.241 x 10[12] digits were given with a help of supercomputer. Although there is still no mathematical proof which shows either randomness or nonrandomness of the digit sequence of pi, it has a potential as a PRN. Hence, we are inspired to carry out statistical tests on randomness for the number sequence from pi, and to compare its results with other algorithms for PRN. Two sets of statistical test together with a test through Monte Carlo simulation showed that the PRN generator based on pi is by no means inferior to other methods. In some tests, it exhibits even superiority as well. As the number pi is known to have several parallel algorithms for its calculation, a parallel computation of PRN generation can be considered in the future.
Journal

 同志社大学理工学研究報告

同志社大学理工学研究報告 49 (3), [160]168, 20081031
Science and Engineering Research Institute of Doshisha University
 Tweet
Details 詳細情報について

 CRID
 1390853649843307264

 NII Article ID
 110006981233

 NII Book ID
 AN00165868

 NDL BIB ID
 9720276

 ISSN
 00368172

 Text Lang
 en

 Data Source

 JaLC
 IRDB
 NDL
 CiNii Articles

 Abstract License Flag
 Allowed