Prime numbers and random walks in a square grid
arXiv:2105.12547 · doi:10.1103/PhysRevE.104.054114
Abstract
In recent years, computer simulations are playing a fundamental role in unveiling some of the most intriguing features of prime numbers. In this work, we define an algorithm for a deterministic walk through a two-dimensional grid that we refer to as Prime Walk. The walk is constructed from a sequence of steps dictated by and dependent on the sequence of last digits of the primes. Despite the apparent randomness of this generating sequence, the resulting structure -- both in 2d and 3d -- created by the algorithm presents remarkable properties and regularities in its pattern that we proceed to analyze in detail.
arXiv comment7 pages, 7 figures
References in corpus (6)
- Localization of maximal entropy random walk
- Unexpected biases in the distribution of consecutive primes
- Nearest neighbor spacing distribution of prime numbers and quantum chaos
- Hidden structure in the randomness of the prime number sequence?
- The complex architecture of primes and natural numbers
- Jacob's Ladder: Prime numbers in 2d