We can store all the primes up to $l$ in a list. The list, however, will be impractical.

**Question** is: given $n$ find the $n-th$ prime.

The interesting part, actually, we don't need to find exactly $n-th$ prime. Finding a unique prime for each $i, 1 \leq i \leq n$ is enough.

*Mathematica* can find the $n$th prime extremely quickly. For instance, it can find the $10^{10}$th prime ($252097800623$) in $0.55$ seconds.

October 11, 2018 15:17 PM

- Serverfault Help
- Superuser Help
- Ubuntu Help
- Webapps Help
- Webmasters Help
- Programmers Help
- Dba Help
- Drupal Help
- Wordpress Help
- Magento Help
- Joomla Help
- Android Help
- Apple Help
- Game Help
- Gaming Help
- Blender Help
- Ux Help
- Cooking Help
- Photo Help
- Stats Help
- Math Help
- Diy Help
- Gis Help
- Tex Help
- Meta Help
- Electronics Help
- Stackoverflow Help
- Bitcoin Help
- Ethereum Help