![]() |
![]() |
#1 |
Dec 2008
Boycotting the Soapbox
13208 Posts |
![]()
If you had a program that could complete a primality-test for a 100M-digit candidate of the form k*2^n+/-1 in ~6 months on a 3.2Ghz quad-core machine, which k and n would you choose?
EDIT: There is a bonus if k has a 2^24th root (mod 2^64-2^32+1) Last fiddled with by __HRB__ on 2010-05-22 at 01:24 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
332.2M - 333.9M (aka 100M digit range) | Uncwilly | LMH > 100M | 695 | 2022-09-05 00:34 |
I want a 100M digit Mersenne that.... | JuanTutors | PrimeNet | 8 | 2012-12-06 13:47 |
How far along are you in your 100M digit LL test? | JuanTutors | Lounge | 6 | 2012-02-21 07:36 |
100M digit prime | Unregistered | Information & Answers | 10 | 2010-03-24 20:16 |
Is it time for a 100M digit option? | petrw1 | PrimeNet | 60 | 2008-09-30 22:43 |