![]() |
![]() |
#23 |
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
245338 Posts |
![]() |
![]() |
![]() |
![]() |
#24 |
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
3·1,621 Posts |
![]() |
![]() |
![]() |
![]() |
#25 |
Mar 2019
24·32 Posts |
![]()
Not entirely sure what prompted this rude reply. But GMP-ECM, when linked against the gwnum library, will auto-detect some numbers of the form k*b^n+c and k*b^n-c and automatically use the faster gwnum_ecmStage1(), at least in some cases.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
P73 found by a yoyo@home user | yoyo | GMP-ECM | 3 | 2017-11-08 15:20 |
larger B1 for GMP-ECM in yoyo@home | yoyo | GMP-ECM | 41 | 2017-01-04 05:53 |
yoyo@home and wikipedia | Dubslow | Factoring | 1 | 2015-12-06 15:56 |
Base-6 speed for prime testing vs. base-2 | jasong | Conjectures 'R Us | 36 | 2010-08-03 06:25 |
New Linux Local Root Exploit | tinhnho | Linux | 0 | 2005-01-17 05:48 |