Related papers: On small gaps among primes
A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which are known…
A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which sequences…
A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which sequences…
A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which sequences…
A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which are known…
Recently Oliver and Soundararajan made conjectures based on computational enumerations about the frequency of occurrence of pairs of last digits for consecutive primes. By studying Eratosthenes sieve, we have identified discrete dynamic…
We study the gaps between consecutive prime numbers directly through Eratosthenes sieve. Using elementary methods, we identify a recursive relation for these gaps and for specific sequences of consecutive gaps, known as constellations.…
Viewing Eratosthenes sieve as a discrete dynamic system, we show that every admissible instance of every admissible constellation of gaps arises and persists in Eratosthenes sieve. For an admissible constellation of length J, we show that…
We have been studying Eratosthenes sieve as a discrete dynamic system, obtaining exact models for the relative populations for small gaps (currently gaps $g \le 82$) in the cycle of gaps ${\mathcal G}(p^\#)$ at each stage of the sieve. The…
In 2016 Lemke Oliver and Soundararajan examined the gaps between the first hundred million primes and observed biases in their distributions modulo 10. Given our work on the evolution of the populations of various gaps across stages of…
We have shown previously that at each stage of Eratosthenes sieve there is a corresponding cycle of gaps $\mathcal{G}(p_0^\#)$. We can view these cycles of gaps as a discrete dynamic system, and from this system we can obtain exact models…
In this document, prime numbers are related as functions over time, mimicking the Sieve of Eratosthenes. For this purpose, the mathematical representation is a uni-dimentional time line depicting the number line for positive natural numbers…
We suggest other models of sieve generated sequences like the Sieve of Eratosthenes to explain randomness properties of the prime numbers, like the twin prime conjecture, the lim sup conjecture, the Riemann conjecture, and the prime number…
We describe recurring patterns of numbers that survive each wave of the Sieve of Eratosthenes, including symmetries, uniform subdivisions, and quantifiable, predictive cycles that characterize their distribution across the number line. We…
We study the distribution of the sequence of elements of the discrete dynamical system generated by iterations of the M\"obius map $x \mapsto (ax + b)/(cx+d)$ over a finite field of $p$ elements at the moments of time that correspond to…
The distribution of prime constellations, such as Twin Primes ($p, p+2$), is traditionally analyzed via probabilistic models or analytic sieve theory. While heuristic predictions are accurate, rigorous proofs are obstructed by the "Parity…
This chapter reviews the dynamical processes in young stellar clusters. The accretion of gas by individual stars affects the dynamics of the cluster, and the masses of the stars. Dynamical mass segregation cannot explain the degree of mass…
We show that there exists pairs of consecutive primes less than $x$ whose difference is larger than $t(1+o(1))(\log{x})(\log\log{x})(\log\log\log\log{x})(\log\log\log{x})^{-2}$ for any fixed $t$. Our proof works by incorporating recent…
Most complex systems are intrinsically dynamic in nature. The evolution of a dynamic complex system is typically represented as a sequence of snapshots, where each snapshot describes the configuration of the system at a particular instant…
Extending our work on the $k$-tuple conjecture, we apply those methods to the Engelsma counterexamples (narrow constellations) of length $J=459$ and span $|s|=3242$. We track the evolution of these $58$ counterexamples from inadmissible…