Related papers: On the differences between consecutive prime numbe…

The goal of the present paper is to present a method of proving of Diophantine inequalities with primes through the use of auxiliary inequalities and available evaluations of the difference between consecutive primes. We study the Legendre…

Based on the primes less than $4 \times 10^{18}$, Oliveira e Silva et al. (2014) conjectured an asymptotic formula for the sum of the $k$th power of the gaps between consecutive primes less than a large number $x$. We show that the…

Under the assumption of infinitely many Siegel zeroes $s$ with $Re(s)>1-\frac{1}{(\log q)^{R}}$ for a sufficiently large value of $R$, we prove that there exist infinitely many $m$-tuples of primes that are $\ll e^{1.9828m}$ apart. This…

Let $k\ge 1$ be an integer. We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{k}+p_{2}^{2}+p_{3}^{2}$, where $p_1,p_2,p_3$ are prime numbers, holds in intervals shorter than the ones…

There is extensive numerical support for the prime-pair conjecture (PPC) of Hardy and Littlewood (1923) on the asymptotic behavior of pi_{2r}(x), the number of prime pairs (p,p+2r) with p not exceeding x. However, it is still not known…

Using evaluations of the difference between consecutive primes we develop another way of estimating of the number of primes in the interval $(n, 2n)$. We also discuss the ultra Cramer conjecture, $p_{n+1} - p_n = O(log^{1+\epsilon}p_n)$…

For a fixed integer $r\ge1$, we say $k$-tuple integers $(x_1,\ldots,x_k)$ are relatively $r$-prime if there exists no prime $p$ such that all $k$ integers is multiple of $p^r$. Benkoski proved that the number of relatively $r$-prime…

The idea of generating prime numbers through sequence of sets of co-primes was the starting point of this paper that ends up by proving two conjectures, the existence of infinitely many twin primes and the Goldbach conjecture. The main idea…

We give a simple method for estimating the average of singular series' associated with prime k-tuples.

Update: This work reproduces an earlier result of Peck, which the author was initially unaware of. The method of the proof is essentially the same as the original work of Peck. There are no new results. We show that the sum of squares of…

In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.

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…

Let $p_{1}$, ..., $p_{k}$ be the first $k$ odd primes in succession. Let $n$ be an even integer such that $n > p_{k}$. We conjecture that if none of $n - p_{1}$, ..., $n - p_{k}$ are prime, then at least one of them has a prime factor which…

Sums of the singular series constants that appear in the Hardy--Littlewood $k$-tuples conjectures have long been studied in connection to the distribution of primes. We study constrained sums of singular series, where the sum is taken over…

In a surprising recent work, Lemke Oliver and Soundararajan noticed how experimental data exhibits erratic distributions for consecutive pairs of primes in arithmetic progressions, and proposed a heuristic model based on the…

This paper introduces a new method to find the next prime number after a given prime ${P}$. The proposed method is used to derive a system of inequalities, that serve as constraints which should be satisfied by all primes whose successor is…

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…

We establish an asymptotic formula for the number of k-difference twin primes associated with the Hawkins random sieve, which is a probabilistic model of the Eratosthenes sieve. The formula for k=1 was obtained by Wunderlich [Acta Arith. 26…

For any positive integer r, let pi_{2r}(x) denote the number of prime pairs (p, p+2r) with p not exceeding (large) x. According to the prime-pair conjecture of Hardy and Littlewood, pi_{2r}(x) should be asymptotic to 2C_{2r}li_2(x) with an…

In this paper, using the well known fact that the series of reciprocals of primes diverges, we obtain a general inequality for gaps of consecutive primes that holds for infinitely many primes. As it is shown the key ingredient for this…