Related papers: Describe Prime number gaps pattern by Logistic map…
Assuming the Riemann hypothesis, this article discusses a new elementary argument that seems to prove that the maximal prime gap of a finite sequence of primes p_1, p_2, ..., p_n <= x, satisfies max {p_(n+1) - p_n : p_n <= x} <=…
We introduce a new probabilistic model of the primes consisting of integers that survive the sieving process when a random residue class is selected for every prime modulus below a specific bound. From a rigorous analysis of this model, we…
The difference between two consecutive prime numbers is called the distance between the primes. We study the statistical properties of the distances and their increments (the difference between two consecutive distances) for a sequence…
In this work, we propose a generalization to the classical logistic map. The generalized map preserves most properties of the classical map and has richer dynamics as it contains the fractional order and one more parameter. We propose the…
We visit a previously proposed discontinuous, two-parameter generalization of the continuous, one-parameter logistic map and present exhaustive numerical studies of the behavior for different values of the two parameters and initial points.…
A distinguishing feature of certain intractable problems in prime number theory is the sparsity of the underlying sequence. Motivated by the general problem of finding primes in sparse polynomial sequences, we give an estimate for the…
This paper has a double goal, the first one is to make a slight survey of some theoretical results about the existence of positively invariant curves that allow to describe important properties of the set of bounded orbits and its boundary…
Recently patterns were found in the least significant digits in the logistic map orbits in the chaotic regime. However, the dynamic of these digits was not explored in deep. We propose a new interpretation of the patterns found in the least…
In the paper we present a description of complex systems in terms of self-organization processes of prime integer relations. A prime integer relation is an indivisible element made up of integers as the basic constituents following a single…
We prove that a positive proportion of the gaps between consecutive primes are short gaps of length less than any fixed fraction of the average spacing between primes.
Partitions of the set of primes are introduced based on the Chebyshev polynomials at rationals. The prime densities of all such partitions are established. Euler's Criterion for $SL(2,\mathbb Q)$ is formulated, which is the bridge between…
Suppose that $1<c<9/8$. For any $m\geq 1$, there exist infinitely many $n$ such that $$ \{[n^c],\ [(n+1)^c],\ \ldots,\ [(n+k_0)^c]\} $$ contains at least $m+1$ primes, if $k_0$ is sufficiently large (only depending on $m$).
Alignment algorithms usually rely on simplified models of gaps for computational efficiency. Based on an isomorphism between alignments and physical helix-coil models, we show in statistical mechanics that alignments with realistic laws for…
Let $p_{k}$ denote the $k$-th prime and $d(p_{k}) = p_{k} - p_{k - 1}$, the difference between consecutive primes. We denote by $N_{\epsilon}(x)$ the number of primes $\leq x$ which satisfy the inequality $d(p_{k}) \leq (\log p_{k})^{2 +…
We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…
A sieve is constructed for twin primes at distance 4, which are of the form 3(2m+1)+/-2, and are characterized by their twin-4 rank 2m+1. It has no parity problem. Non-ranks are identified as all other odd numbers and counted using odd…
The Prime Number Theorem states that the number of primes in $\{1,\ldots,x\}$, denoted $\pi(x)$, is approximately $\frac{x}{\ln(x)}$. In this paper, we investigate the distribution of primes for domains other than $\N$. First we look at…
This paper presents a distinctive prime detection approach. This method use GM-(n+1) sequences to effectively eliminate complex numbers. The sequences, which consist of odd a number of (n+1), exclude all components except for the initial…
Let $k\ge 1$ be an integer, and let $P= (f_1(x), \ldots, f_k(x) )$ be $k$ admissible linear polynomials over the integers, or \textit{the pattern}. We present two algorithms that find all integers $x$ where $\max{ \{f_i(x) \} } \le n$ and…
In this work we show that the prime distribution is deterministic. Indeed the set of prime numbers P can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The prime…