Related papers: Bounded Gaps Between Primes in Multidimensional He…

We give an estimation of the existence density for the $2d$ different primes by using a new and simple algorithm for getting the $2d$ different primes. The algorithm is a kind of the sieve method, but the remainders are the central numbers…

Consider the set of all natural numbers that are co-prime to primes less than or equal to a given prime. Then given a consecutive pair of numbers in that set with an arbitrary even gap, we prove there exists an unbounded number of actual…

In this note we present a method to bound gaps between primes via the divergence of the series of reciprocals of the prime numbers, a consequence of a version of the Bertrand's test for convergence of series of positive numbers and a…

Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$…

Based on symbolic dynamics methods, we show the primes gap pattern could be described by the chaos orbit of Logistic mapping X(k+1)=1-uX(k)^2, u=1.5437. If so, there will be arbitrarily many twin primes.

In this paper we prove an asymptotic formula for the number of solutions in prime numbers to systems of simultaneous linear inequalities with algebraic coefficients. For $m$ simultaneous inequalities we require at least $m+2$ variables,…

We use the Burgess bound and Selberg sieve to obtain an upper bound on the second moment of sums over an interval $[u+1,u+h]$ of Legendre symbols modulo primes $p$ in a dyadic interval $[Q,2Q]$. The bound is nontrivial and gives a power…

For any number field $K$ and integer $0\leq r \leq 4$, we prove that there are infinitely many elliptic curves over $K$ of rank $r$. Our elliptic curves are obtained by specializing well-chosen nonisotrivial elliptic curves over the…

We investigate the sufficient conditions for boundedness of one type of difference equations of the form $x(n+1)=ax(n)+f(x(n)) + y(n), \ n\geq 1$ in critical case $|a|=1$. For this equation the following assumptions are introduced: 1) The…

We investigate certain finiteness questions that arise naturally when studying approximations modulo prime powers of p-adic Galois representations coming from modular forms. We link these finiteness statements with a question by K. Buzzard…

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…

The Gaussian moat problem asks whether it is possible to find an infinite sequence of distinct Gaussian prime numbers such that the difference between consecutive numbers in the sequence is bounded. In this paper, we have proved that the…

In a previous paper, the authors proved that in any system of three linear forms satisfying obvious necessary local conditions, there are at least two forms that infinitely often assume $E_2$-values; i.e., values that are products of…

We show that the greatest prime factor of $n^2+h$ is at least $n^{1.312}$ infinitely often. This gives an unconditional proof for the range previously known under the Selberg eigenvalue conjecture. Furthermore, we get uniformity in $h \leq…

We provide a way to modify and to extend a previously established inequality by P. Erd\H{o}s, R. Graham and others and to answer a conjecture posed in the nineties by R. Graham, which bears on the lack of divisibility of the central…

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…

By using the inner diameter distance condition we define and investigate new, in such a generality, class $\mathcal{F}$ of homeomorphisms between domains in metric spaces and show that, under additional assumptions on domains, $\mathcal{F}$…

We prove that given $\lambda \in \mathbb{R}$ such that $0 < \lambda < 1$, then $\pi(x + x^\lambda) - \pi(x) \sim \displaystyle \frac{x^\lambda}{\log(x)}$. This solves a long-standing problem concerning the existence of primes in short…

Let $q>r\ge1$ be coprime positive integers. We empirically study the maximal gaps $G_{q,r}(x)$ between primes $p=qn+r\le x$, $n\in{\mathbb N}$. Extensive computations suggest that almost always $G_{q,r}(x)<\varphi(q)\log^2x$. More…

Let E and E' be two elliptic curves over a number field. We prove that the reductions of E and E' at a finite place p are geometrically isogenous for infinitely many p, and draw consequences for the existence of supersingular primes. This…