SearcharxivSearch

arXiv · 1801.01540

Jacob's Ladder: Prime numbers in 2d

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.

Explore related subjects

Keep this discovery

BibTeXRIS

Alberto Fraile, Roberto Martinez, Daniel Fernandez. 2020-02-02. Jacob's Ladder: Prime numbers in 2d. https://doi.org/10.3390/mca25010005

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO