search

TilmanNeumann / java-math-library

A Java math library focused on number theory and integer factorization in particular.
GNU General Public License v3.0
29 stars 7 forks source link

FactorizerTest #4

Closed Pascal66 closed 4 years ago

Pascal66 commented 4 years ago

After 63 bits : 

2019-10-25 15:12:15,912 INFO  FactorizerTest(208) [main]: Test N with 63 bits, i.e. N >= 4611686018427387904
2019-10-25 15:13:25,361 INFO  FactorizerTest(314) [main]: #1: Algorithm SquFoF63 took 1s, 113ms
2019-10-25 15:13:25,362 INFO  FactorizerTest(314) [main]: #2: Algorithm CFrac63(all_i=true, ks_adjust=3, stop=(5, 1.5), C=0.152, maxSuSmoothExp=0.25, TDiv63-01) took 1s, 785ms
2019-10-25 15:13:25,362 INFO  FactorizerTest(314) [main]: #3: Algorithm HartLA63(C=0.2, maxSuSmoothExp=0.4, TDiv63-01) took 1m, 6s, 469ms
2019-10-25 15:13:25,493 INFO  FactorizerTest(208) [main]: Test N with 64 bits, i.e. N >= 9223372036854775808
2019-10-25 15:13:26,523 ERROR HartLA63(236) [main]: Hart_Fast: Failed to factor N=17530346973326274709. Either it has factors < cbrt(N) needing trial division, or the arrays are too small.
2019-10-25 15:13:27,509 ERROR HartLA63(236) [main]: Hart_Fast: Failed to factor N=16572762435927399431. Either it has factors < cbrt(N) needing trial division, or the arrays are too small.
TilmanNeumann commented 4 years ago

closed by accepted pull request