Number of Primes between two integers

  • Thread starter Thread starter Cheung
  • Start date Start date
  • Tags Tags
    Integers Primes
AI Thread Summary
There is currently no known formula that can calculate the exact number of prime numbers between two integers without prior knowledge of those primes. While methods like Legendre's and Miessel's provide exact counts, they rely on previously identified primes. The Prime Number Theorem suggests that as numbers approach infinity, prime distribution can be estimated, but this does not yield an exact count. The use of the prime counting function pi(n) is acknowledged, but it is often viewed as an algorithm rather than a straightforward formula. The discussion emphasizes the ongoing search for a true formula that would define the number of primes solely based on two given boundaries.
Cheung
Messages
3
Reaction score
0
Is there a formula to calculate the EXACT number of primes between two integers? There are many very good ways of ESTIMATING the number but I have found very few that give the EXACT number, and those that do essentially require the knowledge of primes before hand (Legendre and Miessel.) While those are all nice I am looking for a formula (not an algorithm) that will spit out the EXACT number of primes by knowing only the two boundaries. Has it been done?
 
Mathematics news on Phys.org
Exact? No. But as the numbers in question approach infinity, they behave more accordingly to the Prime Number Theorem.
 
With the use of pi(n) you could easily construct a forumula for the number of primes between two integers i and j. However, I imagine that you would classify pi(n) as being an "algorithm" rather than a "formula".

http://mathworld.wolfram.com/PrimeCountingFunction.html
 
Thank you both for your reply's and to jbriggs444 I would consider using the logarithmic pi(x) an algorithm. I am looking for a formula/ function that would shed more light on the distribution of primes by solving for the number of primes using only the two integer limits.
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Back
Top