Simple Normality Test with Application to Random Number Generation
Numbers such as π, e, log 2 or √2 have binary digits (bits) that look randomly distributed. They are very good candidates to generate randomness especially in cryptography. One way to assess their randomness is by proving that they are normal numbers. Such a proof has remained elusive for centuries. Here I focus on a different type of numbers that seem a lot easier to handle, such as (2π)-1 arccos(3/5). To test normality, the most well-known tool is […]