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="">


MANDATORY: Please prove that you are human:

124 xor 125 = ?

What is the serial baud rate of the FG device ?


Answer the riddle correctly before clicking "Submit", or comment will NOT appear! Not in moderation queue, NOWHERE!

// Script to allow anchoring of user-selected content on html pages. // Original idea deployed by http://archive.today // Packaged for WordPress on http://trilema.com/2015/that-spiffy-selection-thing/