Miller–Rabin primality test: Difference between revisions

Content added Content deleted

Inline

@@ Line 695: / Line 695: @@
 //  'k' value determines the number of times the value is tested for probable primality.
 //  (higher k value increases the probability that given n value is correctly identified
-//  as prime or not, but also reduces algorithm efficiency)
+//  as prime or not)
 bool isPrime(int n, int k);