Phuctor is Back!

Phuctor is back!

Now using Bernstein’s Algorithm (D. J. Bernstein. How to find smooth parts of integers.) The entire set is pairwise-GCD’d hourly.

This entry was written by Stanislav , posted on Friday April 29 2016 , filed under Cold Air, Computation, Cryptography, Friends, Mathematics, NonLoper, Papers, ShouldersGiants . Bookmark the permalink . Post a comment below or leave a trackback: Trackback URL.

Leave a Reply

XHTML: You can use these tags: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong> <pre lang="" line="" escaped="" highlight="">