![]() |
![]() |
#12 | |
Apr 2020
52×37 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#13 | |
Sep 2002
Database er0rr
23·3·11·17 Posts |
![]()
Has anyone done a speed comparison test for a batch of odd numbers < 2^64 between sprp
Quote:
[*] 2-sprp plus strong 2 selfridge strong Lucas chain. Last fiddled with by paulunderwood on 2021-04-28 at 14:45 |
|
![]() |
![]() |
![]() |
#14 | |
Mar 2021
22×11 Posts |
![]() Quote:
I feel like my other post ended up being a waste of time for me and others here's time, and if i have I had these bigger number lists to test against then i could have avoided making the post in the first place since i would have had better numbers to test against and came to the same conclusion ( that my test wasn't better) before hand. That's all really, i just have stuff i'm working on and could use a few gig's worth of numbers to test against. I'm really not opposed to spending money on some equipment that would help me generate these numbers, i just don't know what that equipment would be, right now i just have a laptop which isn't enough to generate the number sizes i'm looking for Last fiddled with by LarsNet on 2021-04-28 at 18:45 |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Where to find Prime Gap lists? | jaydfox | Prime Gap Searches | 43 | 2021-07-19 17:56 |
Using CUDA to find better SPRP classifiers | SPWorley | Computer Science & Computational Number Theory | 11 | 2012-11-21 20:13 |
Why arent there many softwares for finding Huge Primes | blistervol | Math | 2 | 2012-08-20 17:26 |
An aliquot sequence with huge, huge, huge tracts of sand !!! | garambois | Aliquot Sequences | 50 | 2012-01-19 18:25 |
Why Search for these Huge Primes? | Unregistered | Math | 8 | 2005-04-27 00:55 |