Three Theorems on modular sieves that suggest the Prime Difference is O(Number of primes < (p(n)^1/2))

Details Three Theorems on modular sieves that suggest the Prime Difference is O(Number of primes < (p(n)^1/2)) Three Theorems on modular sieves that suggest the Prime Difference is O(Number of primes < (p(n)^1/2))

2005-12-26

arxiv.org/abs/math/0512580v1

Mathematics

General Mathematics

6 pages; an HTML version is available at http://alixcomsi.com/Three_Theorems.htm

Scientific paper

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)).

Affiliated with

Also associated with

No associations

Rating

Three Theorems on modular sieves that suggest the Prime Difference is O(Number of primes < (p(n)^1/2)) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Three Theorems on modular sieves that suggest the Prime Difference is O(Number of primes < (p(n)^1/2)), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Three Theorems on modular sieves that suggest the Prime Difference is O(Number of primes < (p(n)^1/2)) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-291067