Article Jacob’s Ladder: Prime numbers in 2d Alberto Fraile 1,*, Roberto Martínez 2 and Daniel Fernández 3 1 Czech Technical University Prague. Department of Control Engineering, Advanced Materials Group Praha 2, Karlovo námˇestí13, E-s136, Czech Republic;
[email protected] 2 Universidad del País Vasco - Euskal Herriko Unibertsitatea, Barrio Sarriena s/n 48940 Leioa. Bizkaia, Spain;
[email protected] 3 University of Iceland, Science Institute, Dunhaga 3, 107 Reykjavík, Iceland;
[email protected] * Correspondence:
[email protected] Version February 4, 2020 submitted to Math. Comput. Appl. Abstract: Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense variety of problems. In this work, we present a simple representation of prime numbers in two dimensions that allows us to formulate a number of conjectures that may lead to important avenues in the field of research on prime numbers. In particular, although the zeroes in our representation grow in a somewhat erratic, hardly predictable way, the gaps between them present a remarkable and intriguing property: a clear exponential decay in the frequency of gaps vs gap size. The smaller the gaps, the more frequently they appear. Additionally, the sequence of zeroes, despite being non-consecutive numbers, contains a number of primes approximately equal to n/ log n , being n the number of terms in the sequence. Keywords: Prime numbers, Number theory, Number sequences 1. Introduction Prime numbers have fascinated mathematicians since the beginnings of Mathematics (Ingham, Littlewood, Anglin, Apostol).