Other Random Sequences

  • Ronald T. Kneusel


Sequences of numbers that can be used as-is or transformed into random numbers are the topic of this chapter. We are not concerned here with the practicality of such sequences for use where pseudorandom generators are typically used, but instead present them for fun as they are interesting in their own right. We will look at the randomness of the digits in base 10 and base 16 expansions of numbers that are known to be normal or believed to be normal. We will consider the sequence of digits in factorials of different sizes. We will look at the sequence of bits generated by 1-D cellular automata, in particular Wolfram’s “Rule 30”. Lastly, we will consider how to use 1-D chaotic maps to generate a sequence of random numbers. In all cases we will test the sequences using either dieharder, TestU01, or ent. We conclude the chapter with a section on using genetic programming to evolve a simple pseudorandom number generator.


  1. 1.
    Borel, M. Émile. “Les probabilités dénombrables et leurs applications arithmétiques.” Rendiconti del Circolo Matematico di Palermo (1884–1940) 27, no. 1 (1909): 247–271.Google Scholar
  2. 2.
    Kneusel, Ronald T. Numbers and Computers. Springer International Publishing, 2017.Google Scholar
  3. 3.
    Kennedy, R. J. and Eberhart,“ Particle swarm optimization.” In Proceedings of IEEE International Conference on Neural Networks IV, pages, vol. 1000. 1995.Google Scholar
  4. 4.
    Conway, John. “The game of life.” Scientific American 223, no. 4 (1970): 4.Google Scholar
  5. 5.
    Wolfram, Stephen. A new kind of science. Vol. 5. Champaign: Wolfram media, 2002.Google Scholar
  6. 6.
    Pareek, Narendra K., Vinod Patidar, and Krishan K. Sud. “A Random Bit Generator Using Chaotic Maps.” IJ Network Security 10, no. 1 (2010): 32–38.Google Scholar
  7. 7.
    Koza, John R. Genetic programming: on the programming of computers by means of natural selection. Vol. 1. MIT press, 1992.Google Scholar
  8. 8.
    Koza, John R. “Evolving a Computer Program to Generate Random Numbers Using the Genetic Programming Paradigm.” In ICGA, pp. 37–44. 1991.Google Scholar
  9. 9.
    Lamenca-Martinez, Carlos, Julio Cesar Hernandez-Castro, Juan M. Estevez-Tapiador, and Arturo Ribagorda. “Lamar: A new pseudorandom number generator evolved by means of genetic programming.” In PPSN, pp. 850–859. 2006.Google Scholar
  10. 10.
    Picek, Stjepan, Dominik Sisejkovic, Vladimir Rozic, Bohan Yang, Domagoj Jakobovic, and Nele Mentens. “Evolving cryptographic pseudorandom number generators.” In International Conference on Parallel Problem Solving from Nature, pp. 613–622. Springer International Publishing, 2016.Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Ronald T. Kneusel
    • 1
  1. 1.ThorntonUSA

Personalised recommendations