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
A Note on the Measure of Vector and Pythagorean Theorem
Yu. V. Brezhnev
On Weighted Convex Graphs
Angshuman R. Goswami
On characterizations, Decompositions, and Stability of Convex Sequences
Angshuman R. Goswami
New Laplace convolution integrals involving exponential, error, and parabolic cylinder functions with applications in heat transfer and linear viscoelasticity
González Santander, Juan Luis
Resolution of Singularities in Positive Characteristic: Frobenius-Hasse Towers and Exceptional-History Descent
Chenxiao Tian
Information Geometry (IG) Lives at Edge or Boundary of SMG (statistically meaningful geometry): - the First Edge Theorem and Applications
Bing Cheng, Yi-Shuai Niu, Howell Tong et al.