sci.crypt archive
Re: A factoring algorithm
From: Paul Rubin <//phr.cx@NOSPAM.invalid>
Date: Tue Jan 10 2006 - 00:23:51 CET
Date: Tue Jan 10 2006 - 00:23:51 CET
<wbhart@sbcglobal.net> writes:
> > The catch is that the size of the numbers becomes exponentially big,
>
> yep. Involves factorials of numbers or something IIRC.
It's an exercise in Knuth v. 2.
Received on Tue Jan 17 16:49:27 2006