arXiv · math/0603450
Pseudo Random test of prime numbers
Abstract
The prime numbers look like a randomly chosen sequence of natural numbers, but there is still no strict theory to determine 'Randomness'. In these years, cryptography has developed a battery of statistical tests for randomness. In this paper, we just apply these methods to study the distribution of primes. Here the binary sequence constructed by second difference of primes is used as samples. We find this sequence can't reach all the 'random standard' of FIPS 140-1/2, but still show obvious random feature. The interesting self-similarity is also observed in this sequence. These results add the evidence that prime numbers is a chaos system.
Explore related subjects
Keep this discovery
Wang Liang, Huang Yan. 2006-03-18. Pseudo Random test of prime numbers. https://arxiv.org/abs/math/0603450
Cite the original work for its findings. Save a collection to share your selection of sources.