Related papers: A Sieve for Twin Primes
In this paper it was shown that all prime numbers lie on 96 half-lines. At the same time, it was shown that if a given number does not lie on any of the above half-lines, then it is a composite number. A corresponding linear mathematical…
It is proven that there are infinitely prime pairs whose difference is no greater than 84. In proving that result, a new sieve weight is constructed. The new idea is to construct the largest sieve support which admits the use of the…
Let $K\geq 2$ be a natural number and $a_i,b_i\in\mathbb{Z}$ for $i=1,\ldots,K-1$. We use the large sieve to derive explicit upper bounds for the number of prime $k$-tuplets, i.e., for the number of primes $p\leq x$ for which all $a_ip+b_i$…
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…
We verify the Hardy-Littlewood conjecture on primes in quadratic progressions on average. The results in the present paper significantly improve those of a previous paper of the authors(arXiv:math.NT/0605563).
For a set of primes $\mathcal{P}$, let $\Psi(x, \mathcal{P})$ be the number of positive integers $n \leq x$ all of whose prime factors lie in $\mathcal{P}$. In this paper we classify the sets of primes $\mathcal{P}$ such that $\Psi(x,…
In this paper, we introduced the theory of the sieve function transformation. Using the principle of sieve function transformation, we improved sieve method, and obtained the difference range of similar sieve function values. For this, we…
Two-side estimates for two-weighted discrete Hardy-type operators on a tree are obtained. For general weights we prove the discrete analogue of Evans - Harris - Pick theorem (it is a quite simple consequence from their result). It gives the…
Gardiner, Lazarus, Metropolis, and Ulam introduced a variation of the sieve of Eratosthenes that (instead of producing the sequence of prime numbers) produces the sequence of "lucky numbers". The distribution of lucky numbers has a striking…
The main result of the paper is that assuming that the level $\theta$ of distribution of primes exceeds 1/2, then there exists a positive $d\leq C(\theta)$ such that there are arbitrarily long arithmetic progressions with the property that…
Let $v\geq 2$ be a fixed integer, and let $x \geq 1$ and $z \geq x$ be large numbers. The exact asymptotic formula for the number of Wieferich primes $p$ such that $ v^{p-1} \equiv 1 \bmod p^2$ in the short interval $[x,x+z]$ is proposed in…
A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…
We present a method for finding large fixed-size primes of the form $X^2+c$. We study the density of primes on the sets $E_c = \{N(X,c)=X^2+c,\ X \in (2\mathbb{Z}+(c-1))\}$, $c \in \mathbb{N}^*$. We describe an algorithm for generating…
Prime factorization is an outstanding problem in arithmetic, with important consequences in a variety of fields, most notably cryptography. Here we employ the intriguing analogy between prime factorization and optical interferometry in…
Let $m \in \mathbb{N}$ be large. We show that there exist infinitely many primes $q_{1}< \cdot\cdot\cdot < q_{m+1}$ such that \[ q_{m+1}-q_{1}=O(e^{7.63m}) \] and $q_{j}+2$ has at most \[ \frac{7.36m}{\log 2} + \frac{4\log m}{\log 2} + 21…
Suppose P is a set of primes, such that for every p in P, every prime factor of p-1 is also in P. If P does not contain all primes, we apply a new sieve method to show that the counting function of P is O(x^{1-c}) for some c>0, where c…
We improve Irving's method of the double-sieve by using the DHR sieve. By extending the upper and lower sieve functions into their respective non-elementary ranges, we are able to make improvements on the previous records on the number of…
Given an integer n>1, it is a classical Diophantine problem that whether n can be written as a sum of two rational cubes. The study of this problem, considering several special cases of n, has a copious history that can be traced back to…
By using Beta Dirichlet series and then Eisenstein series we ca represent primes with first a good approximation and an exact expression. This can be done with arbitrary prime (up to 10^101).
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…