title: Better algorithm to find nth prime number?
body: <p>Until now, I've been using sieve of Eratosthenes for generating all 'n' prime numbers.</p>
  
  <p>However, I was wondering does there exist a better algorithm, or can we improve an existing one which performs better ??</p>