Problem 46117. Test approximations of the prime counting function
Cody Problem 241, which is based on Project Euler Problem 7, asks us to identify the Nth prime number. That is, the problem seeks the inverse of the prime counting function , which provides the number of primes less than or equal to n. The Prime Number Theorem gives approximate forms of for large n. Two such approximations are and the offset logarithmic integral , where (See Cody Problem 46066).
Test these approximations by computing two ratios: and . Do not round the approximations to integers. For , you will find that the first approximation is about 13% low and the second is about 16% high. However, for , the first approximation is 6% low and the second is only 0.01% high.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers14
Suggested Problems
-
2348 Solvers
-
Return unique values without sorting
897 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
470 Solvers
-
144 Solvers
-
Write a function man that takes a row vector v and returns a matrix H as follows..
602 Solvers
More from this Author250
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!