![]() |
![]() |
#1 |
Sep 2011
3·19 Posts |
![]()
Hi, I've read in the CADO-NFS home page that they implement a naive square root. Is this the newton iteration method as described in this old post? https://www.mersenneforum.org/showthread.php?t=6670
What are the advantages and disadvantages of it compared to Nguyen/Montgomery sqrt? I assume it's easier to understand and implement. Does it use more processing time and memory? Last fiddled with by paul0 on 2020-10-06 at 15:28 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
CADO-NFS Square Root Error | Ferrier | CADO-NFS | 3 | 2019-11-01 23:51 |
NFS Square Root failed | wreck | Msieve | 15 | 2019-08-07 22:32 |
Square Root Days | davar55 | Lounge | 0 | 2016-03-16 20:19 |
Square root of 3 | Damian | Math | 3 | 2010-01-01 01:56 |
Divisible up to Square Root | davar55 | Puzzles | 3 | 2007-09-05 15:59 |