getPrime method

int getPrime(
  1. int i
)

Returns the ith prime number.

WARNING: This will generate and store every prime number below the ith. That can be very expensive. That's why the isPrime, primeDecomp etc are carefully implemented to only request primes up to sqrt(n).

Implementation

int getPrime(int i) {
  while (_p.length <= i) {
    addPrime();
  }
  return _p[i];
}