Three Theorems on modular sieves that suggest the Prime Difference is O(Number of primes < (p(n)1/2))
Bhupinder Singh Anand
Abstract
This 1964 paper developed as an off-shoot to the foundational query: Do we discover the natural numbers (Platonically), or do we construct them linguistically? The paper also assumes computational significance in the light of Agrawal, Kayal and Saxena's August 2000 paper, "PRIMES is in P", since both the TRIM and Compact Number Generating algorithms - each of which generates all the primes - are deterministic algorithms that run in polynomial time and suggest that the Prime Difference, d(n), is O(Number of primes < (p(n)1/2)).
Create a lesson
Related papers
On the Rank Condition for Perfect Cuboids
Valery Asiryan
A Local Proof of Langlands's First Main Lemma for Local Epsilon Factors over Nonarchimedean Local Fields
Fukuhiro Ueda
The first type of power mean bounds for the Gaussian hypergeometric function
Zhen-Hang, Yang, Jing-Feng Tian
On a new class of q-fractional integral operators involving multivariate q-Mittag-Leffler functions
Min-Jie Luo, Qing-Hui Peng, Ravinder Krishna Raina
Partition-theoretic density formulas: radial Tauberian theory and non-radial instability
Mohammad F. Marashdeh
Octonionic Kittaneh Numerical Radius Inequalities
K. Mahesh Krishna