Related papers: On twin primes associated with the Hawkins random …

We present an algorithm analogous to the sieve of Eratosthenes that produces the list of twin primes. Next, we count the number of twin primes resulting from the construction with two different heuristic arguments. The first method is…

In 1922 Hardy and Littlewood proposed a conjecture on the asymptotic density of admissible prime k-tuples. In 2011 Wolf computed the "Skewes number" for twin primes, i.e., the first prime at which a reversal of the Hardy-Littlewood…

We measure whether there are numerous pairs of twin primes (hereafter referred to as twin prime pairs) according to the prime number inferred by sieve of Eratosthenes. In this study, we reveal at least three additional twin prime pairs…

For $k \geq 2$, we consider the number $A_k(Z)$ of positive integers $n \leq Z$ such that both $n$ and $n+1$ are $k$-free. We prove an asymptotic formula $A_k(Z) = c_k Z + O(Z^{14/(9k)+\epsilon})$, where the error term improves upon…

We introduce a sieve for counting twin primes up to a given range. Our method depends on a parameter ${\lambda}_x$ and the estimation of the number of twin primes obtained as a result, is called a fundamental structure of the distribution…

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 show by an inclusion-exclusion argument that the prime $k$-tuple conjecture of Hardy and Littlewood provides an asymptotic formula for the number of consecutive prime numbers which are a specified distance apart. This refines one aspect…

In this article we present method of solving some additive problems with primes. The method may be employed to the Goldbach-Euler conjecture and the twin primes conjecture. The presented method also makes it possible to obtain some…

We improve Bombieri's asymptotic sieve to localise the variables. As a consequence, we prove, under a Elliott-Halberstam conjecture, that there exists an infinity of twins almost prime. Those are prime numbers $p$ such that for all…

In this article we present method of solving some additive problems with primes. The method may be employed to the Goldbach-Euler conjecture and the twin primes conjecture. The presented method also makes it possible to obtain some…

We studied two probabilistic models of the distribution of primes in the natural number [1].The paper considers the third probabilistic model of the distribution of primes in the natural number. The author proved that the results obtained…

In this paper we consider a slightly different sieve method from Eratosthenes' to get primes. We find the periodicity and mirror symmetry of the pattern.

We adopt an empirical approach to the characterization of the distribution of twin primes within the set of primes, rather than in the set of all natural numbers. The occurrences of twin primes in any finite sequence of primes are like…

Let $k\geq 2$ and $\mathcal{P} (n) = (A_1 n + B_1 ) \cdots (A_k n + B_k)$ where all the $A_i, B_i$ are integers. Suppose that $\mathcal{P} (n)$ has no fixed prime divisors. For each choice of $k$ it is known that there exists an integer…

We address the question of the infinitude of twin and cousin prime pairs from a probabilistic perspective. Our approach partitions the set of integer numbers greater than $2$ in finite intervals of the form $[p_{n-1}^2,p_n^2)$, $p_{n-1}$…

An s-tuple of positive integers are k-wise relatively prime if any k of them are relatively prime. Exact formula is obtained for the probability that s positive integers are k-wise relatively prime.

Starting with Zhang's theorem on the infinitude of prime doubles, we give an inductive argument that there exists an infinite number of prime $k$-tuples for at least one admissible set $\mathcal{H}_k=\{h_1,\ldots,h_k\}$ for each $k$.

We take the pre-sieved set to be all natural numbers $N=\{1,2,3,\dots\}$ with a sieve system:single sieve,double sieve,.... With single sieve, i.e. , remove out the multiple of a prime, we derive all the primes. With double sieve, i.e. ,…

Statistical distribution of the primes in an arithmetic progression is considered. The estimation of prime numbers is given and combinatorial methods are used to calculate the twin primes on the available interval. The distribution and…

We find an asymptotic formula for the number of pairs of positive integers $x_1, x_2 \le H$ such that the product $x_1 x_2$ is a $k$-th power.