Number of Primes between two integers

  • Thread starter Thread starter Cheung
  • Start date Start date
  • Tags Tags
    Integers Primes
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.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top