Semantic Apparatus – Prime numbers and random walks in a square grid

Cited by Lee Sonogan

Prime Numbers — Definition & Examples - Expii

Abstract by Alberto Fraile, Osame Kinouchi, Prashant Dwivedi, Roberto Martínez, Theophanes E. Raptis, Daniel Fernández

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 (PW). 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.

Publication: Cornell University (Peer-Reviewed Journal)

Pub Date: 26 May, 2021: Doi:

Keywords; Prime Numbers, 2/3D Dynamic, Unknown Random, Square Grid (Plenty more sections and references in this research article)

Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.