AbstractWe 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 M.C. Wunderlich [A probabilistic setting for prime number theory, Acta Arith. 26 (1974) 59–81]. We here extend this to k⩾2 and generalize it to all l-tuples of Hawkins primes
We introduce a new probabilistic model of the primes consisting of integers that survive the sieving...
summary:We give a heuristic proof of a conjecture of Hardy and Littlewood concerning the density of ...
The first digits of twin primes follow a generalized Benford law with size-dependent exponent and te...
AbstractWe establish an asymptotic formula for the number of k-difference twin primes associated wit...
Abstract. We establish an asymptotic formula for the number of k-difference twin primes associated w...
While prime numbers are the fundamental building blocks of the integers, understand-ing how they are...
Abstract. Hawkins introduced a probabilistic version of Era-thostenes ’ sieve and studied the associ...
AbstractA proof is presented that the random sieve, a stochastic analogue of the sieve of Eratosthen...
This paper is about a class of numbers indirectly connected to the twin primes, which have not been ...
We study some new aspects of the twin prime distribution, focusing especially on how the prime pairs...
The famous twin prime conjecture asserts that there are infinitely many pairs of primes differing by...
For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or g...
The sequence 3,5,9,11,15,19,21,25,29,35,… consists of odd legs in right triangles with integer si...
AbstractAre there infinitely many prime pairs with given even difference? Most mathematicians think ...
In this thesis, we focus on the problem of primes in short intervals. We will explore the main ingre...
We introduce a new probabilistic model of the primes consisting of integers that survive the sieving...
summary:We give a heuristic proof of a conjecture of Hardy and Littlewood concerning the density of ...
The first digits of twin primes follow a generalized Benford law with size-dependent exponent and te...
AbstractWe establish an asymptotic formula for the number of k-difference twin primes associated wit...
Abstract. We establish an asymptotic formula for the number of k-difference twin primes associated w...
While prime numbers are the fundamental building blocks of the integers, understand-ing how they are...
Abstract. Hawkins introduced a probabilistic version of Era-thostenes ’ sieve and studied the associ...
AbstractA proof is presented that the random sieve, a stochastic analogue of the sieve of Eratosthen...
This paper is about a class of numbers indirectly connected to the twin primes, which have not been ...
We study some new aspects of the twin prime distribution, focusing especially on how the prime pairs...
The famous twin prime conjecture asserts that there are infinitely many pairs of primes differing by...
For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or g...
The sequence 3,5,9,11,15,19,21,25,29,35,… consists of odd legs in right triangles with integer si...
AbstractAre there infinitely many prime pairs with given even difference? Most mathematicians think ...
In this thesis, we focus on the problem of primes in short intervals. We will explore the main ingre...
We introduce a new probabilistic model of the primes consisting of integers that survive the sieving...
summary:We give a heuristic proof of a conjecture of Hardy and Littlewood concerning the density of ...
The first digits of twin primes follow a generalized Benford law with size-dependent exponent and te...
DOI
Add to ORKG