jsm 4eec310a4f Check large factor for being prime before applying Pollard's ... algorithm; fixes "factor 2147483647111311". Correct comment; algorithm is Pollard p-1, not Pollard rho. Increase base if p-1 algorithm reaches 1; fixes "factor 99999999999991". Testcases from David A Bagley <bagleyd@tux.org>.		2004-02-08 11:47:36 +00:00
..
Makefile	use NETBSDSRCDIR as appropriate	2002-09-19 03:15:39 +00:00
factor.6	Move UCB-licensed code from 4-clause to 3-clause licence.	2003-08-07 09:36:50 +00:00
factor.c	Check large factor for being prime before applying Pollard's	2004-02-08 11:47:36 +00:00