arXiv · 2105.12547
Prime numbers and random walks in a square grid
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.
Explore related subjects
Keep this discovery
Alberto Fraile, Osame Kinouchi, Prashant Dwivedi, Roberto Martínez, Theophanes E. Raptis, Daniel Fernández. 2021-05-26. Prime numbers and random walks in a square grid. https://doi.org/10.1103/physreve.104.054114
Cite the original work for its findings. Save a collection to share your selection of sources.