ref: b56754846555732a300b85e67ebd7b302a7fc491
parent: bbfd63df1fb8871982f403ff944e972895422895
author: cinap_lenrek <cinap_lenrek@felloff.net>
date: Sun Aug 23 19:49:31 EDT 2015
libsec: fix probably_prime() endless loop for n == 3
--- a/sys/src/libsec/port/probably_prime.c
+++ b/sys/src/libsec/port/probably_prime.c
@@ -21,10 +21,10 @@
nrep = 18;
k = mptoi(n);
- if(k == 2) /* 2 is prime */
- return 1;
if(k < 2) /* 1 is not prime */
return 0;
+ if(k == 2 || k == 3) /* 2, 3 is prime */
+ return 1;
if((n->p[0] & 1) == 0) /* even is not prime */
return 0;
--
⑨