public Totient(PrimeSieve p, int iLimit)
{
_p = p;
Limit = iLimit;
if (_p.largestPrime() < iLimit)
{
throw new Exception("Not enough primes generated to calculate to limit");
}
Precalculate();
}
public bool IsPrime(int iNum)
{
if (iNum > _pg.largestPrime())
{
return(_pt.IsPrime(iNum));
}
else
{
return(_pg.IsPrime(iNum));
}
}