how can one find the slowest prime number to be identified by using the using Sieve of Eratosthenes Algorithm? Is there a formula to finding this number? or an explanation how this could be found? Lets say I have 5000 as a number how can I find the slowest prime number?
Identify a finite n, n > 2, such that the Sieve of Eratosthenes will have to decide whether all the previous numbers are prime numbers or not and therefore the running time of the Sieve of Eratosthenes is at its worst for that value of n.