How to find nth prime with complexity o(1)

by

The only way to do this in O(1) would be an array of all prime numbers. So, you’d only be able to support a certain number depending on your computer’s memory.

Edit:

There might be some way to compute this involving a bunch of calculus, but that’s beyond me 🙂

More Related Contents:

  1. How to create the most compact mapping n → isprime(n) up to a limit N?
  2. How to create the most compact mapping n → isprime(n) up to a limit N?
  3. Is log(n!) = Θ(n·log(n))?
  4. náµ—Ê° ugly number
  5. Fastest primality test
  6. The Sieve of Atkin
  7. Given Prime Number N, Compute the Next Prime?
  8. Calculating phi(k) for 1
  9. Complexity of absolute difference and sum
  10. What is a plain English explanation of “Big O” notation?
  11. How can I find the time complexity of an algorithm?
  12. Why do we check up to the square root of a number to determine if the number is prime?
  13. Mapping two integers to one, in a unique and deterministic way
  14. Least common multiple for 3 or more numbers
  15. Select k random elements from a list whose elements have weights
  16. Is it possible to express “t” variable from Cubic Bezier Curve equation?
  17. What’s the fastest algorithm for sorting a linked list?
  18. Need help in mod 1000000007 questions
  19. What is Constant Amortized Time?
  20. Check if one integer is an integer power of another
  21. Modulus power of big numbers
  22. Puzzle: Find largest rectangle (maximal rectangle problem)
  23. How can I calculate the age of a person in year, month, days?
  24. finding a^b^c^… mod m
  25. Determining if two line segments intersect? [duplicate]
  26. Fastest algorithm for circle shift N sized array for M position
  27. How to find distance from the latitude and longitude of two locations?
  28. JavaScript: Calculate the nth root of a number
  29. Optimized low-accuracy approximation to `rootn(x, n)`
  30. Creating combinations that have no more one intersecting element

Leave a Comment