Miller–Rabin primality test: Difference between revisions

public static bool IsPrime(int pn, int k)

if(pn < 2)

if(pn != 2 && pn % 2 == 0)

int s = pn - 1;

for (int i = 10; i < 11k; i++)

double a = r.Next((int)pn - 1) + 1;

int mod = (int)Math.Pow(a, (double)temp) % pn;

while(temp != pn - 1 && mod != 1 && mod != pn - 1)

mod = (mod * mod) % pn;