Communications of the Korean Mathematical Society (대한수학회논문집)

Korean Mathematical Society (대한수학회)
권호 표지

ENTROPY AND THE RANDOMNESS OF THE DIGITS OF PI

  • Geon Ho Choe (Department of Mathematics, Korea Advanced Institute of Science and Technology) ;
  • Dong Han Kim (Department of Mathematics, Korea Advanced Institute of Science and Technology)
  • Published : 2000.10.01
Download PDF
⟨ Previous Next ⟩

Abstract

The convergence rate of the expectation of the logarithm of the first return time R(sub)n with block length n has been investigated for Bernoulli processes. This idea is applied to check the randomness of the digits of the decimal expansion of $\pi$, e and √2.

Keywords

References

  1. Math. comp. v.50 The computation of π to 29,360,000 decimal digits using Borweins'quartically convergent algorithm D. bailey
  2. Pi:A Source book L. Berggren;J. Borwein;P. Borwein
  3. Colloq. Math v.84 Average convergence rate of the first return time G. H. Choe;D. H. kim
  4. Bull. Amer. Math. Soc. v.53 On the notion of recurrence in discrete stochastic processes M. Kac
  5. Kanada Laboratory Y. Kanda
  6. The recurrence of blocks for Bernoulli processes k. H. Kim
  7. J. cryptology v.5 A universal statistical test for random bit generators u. Maurer
  8. Robert J. Nemiroff R. Nemiroff
  9. IEEE Trans. inform. Theory v.39 Entropy and data compression schemes D. Ornstein;B. Weiss
  10. Be.. Sys. Tech. J. v.27 The mathematical theory of communication C. Shannon
  11. Amer. Math. Soc. v.13 The ergodic theory of discrete Sample Paths P. C. Shields
  12. Math. Intelligencer v.7 Is π normal? S. Wagon
  13. An Introduction to Ergodic Theory(2nd edition) p. Walters
  14. IEEE Trans. Inform. Theory v.35 Some asymptotic properties of the entropy of stationary ergodic data source with applications to data compression A. D. Wyner;J. Ziv
  15. EIII Trans. Inform. Theory v.23 A universal algorithm for sequential data compression J. Ziv;A. Lempel