Pollard's rho algorithm: Difference between revisions

Revision as of 03:05, 16 August 2021

Revision as of 04:17, 16 August 2021

Line 165:

public static void main(String[] args) {

/*

For F8 aka Fermat 8th number which as stated above took 2 hours on a UNIVAC computer

Now can be done with this code in a couple minutes with no special optimization

How far we have come!!!

Just comment it in to see for yourself

String n = "115792089237316195423570985008687907853269984665640564039457584007913129639937" ;

*/

String n = "10403" ; //test factoring 10403

BigInteger num = new BigInteger(n) ;