Three Theorems on modular sieves that suggest the Prime Difference is O(Number of primes < (p(n)^1/2))
| dc.creator | Anand, Bhupinder Singh | |
| dc.date | 2005-12-26 | |
| dc.date.accessioned | 2026-07-07T06:55:46Z | |
| dc.date.available | 2026-07-07T06:55:46Z | |
| dc.description | 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)). | |
| dc.description | 6 pages; an HTML version is available at http://alixcomsi.com/Three_Theorems.htm | |
| dc.identifier | https://arxiv.org/abs/math/0512580 | |
| dc.identifier | http://arxiv.org/abs/math/0512580 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/106390 | |
| dc.subject | General Mathematics | |
| dc.subject | 11.04 | |
| dc.title | Three Theorems on modular sieves that suggest the Prime Difference is O(Number of primes < (p(n)^1/2)) | |
| dc.type | text |