Add to ORKGWe explore the subsequence of primes with prime subscripts, (qn), and derive its density and estimates for its counting function. We obtain bounds for the weighted gaps between elements of the subsequence and show that for every positive integer m there is an integer arithmetic progression (an + b: n ∈ N) with at least m of the (qn) satisfying qn = an+ b. Key Words: prime-prime, prime-prime number theorem, prime-prime gaps, prime-primes in progressions
Abstract. A “theoretical ” distribution of prime number gaps is proposed and compared with the actua...
We discuss recent advances on weak forms of the Prime k-tuple Conjecture, and its role in proving ne...
We follow a research paper that J. Elstrodt published in 1998 to prove the Prime Number Theorem for ...
We explore the subsequence of primes with prime subscripts, (qn), and derive its density and estimat...
In this dissertation we consider the problem of finding small prime gaps in various sets $\mathcal{C...
We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ...
AbstractLet G(x;q,a):=maxPn⩽x(Pn+1−Pn),Pn‵Pn+1‵amodq where (a, q) = 1 and Pn, Pn + 1 are consecutive...
This paper is concerned with formulation and demonstration of new versions of equations that can hel...
We describe some of the machinery behind recent progress in establish-ing infinitely many arithmetic...
A prime gap is the difference between two successive prime numbers. Two is the smallest possible gap...
We prove a generalization of the author's work to show that any subset of the primes which is 'well ...
The paper presents a brief history of results about small gaps between con¬secutive primes and menti...
Dirichlet’s theorem on primes in arithmetic progressions states that for any positive integer q and ...
In this paper, a problem posed in [1] by Smarandache concerning the prime gaps is analyzed. Let&apos...
We introduce a refinement of the GPY sieve method for studying prime kk-tuples and small gaps betwee...
Abstract. A “theoretical ” distribution of prime number gaps is proposed and compared with the actua...
We discuss recent advances on weak forms of the Prime k-tuple Conjecture, and its role in proving ne...
We follow a research paper that J. Elstrodt published in 1998 to prove the Prime Number Theorem for ...
We explore the subsequence of primes with prime subscripts, (qn), and derive its density and estimat...
In this dissertation we consider the problem of finding small prime gaps in various sets $\mathcal{C...
We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ...
AbstractLet G(x;q,a):=maxPn⩽x(Pn+1−Pn),Pn‵Pn+1‵amodq where (a, q) = 1 and Pn, Pn + 1 are consecutive...
This paper is concerned with formulation and demonstration of new versions of equations that can hel...
We describe some of the machinery behind recent progress in establish-ing infinitely many arithmetic...
A prime gap is the difference between two successive prime numbers. Two is the smallest possible gap...
We prove a generalization of the author's work to show that any subset of the primes which is 'well ...
The paper presents a brief history of results about small gaps between con¬secutive primes and menti...
Dirichlet’s theorem on primes in arithmetic progressions states that for any positive integer q and ...
In this paper, a problem posed in [1] by Smarandache concerning the prime gaps is analyzed. Let&apos...
We introduce a refinement of the GPY sieve method for studying prime kk-tuples and small gaps betwee...
Abstract. A “theoretical ” distribution of prime number gaps is proposed and compared with the actua...
We discuss recent advances on weak forms of the Prime k-tuple Conjecture, and its role in proving ne...
We follow a research paper that J. Elstrodt published in 1998 to prove the Prime Number Theorem for ...