![]() |
|
|
#1 |
|
May 2003
23×31 Posts |
I had a question about trial factoring. Recently I noticed when I started running a large number of trial factoring assignments, the computer would spit back factors for some numbers that seemed too large. This led to my point of confusion. Since every factor of a Mersenne number has to be of the form 2kp+1, does this mean that Prime95 searches for k between 1 and whatever bits, or does this mean that 2kp+1 must be between 1 and 2^bits?
If it helps, the assignments I loaded into my computer are as follows: AdvancedFactor=240000000,250000000,1,32 AdvancedFactor=240000000,250000000,33,50 AdvancedFactor=240000000,250000000,51,60 AdvancedFactor=240000000,250000000,61,70 |
|
|
|
|
|
#2 |
|
Sep 2002
2·331 Posts |
Prime95 searches one bit depth at a time, so all the 2kp+1 potential factors x bits long, that remain after a seive and other quick elimination tests, are tested then it advances to x+1 bit long potential factors.
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Trial Factoring on AMD/ATI GPU's? | Stargate38 | GPU Computing | 9 | 2018-08-31 07:58 |
| trial factoring with mfakto question | arbiter21 | Information & Answers | 7 | 2016-02-04 17:23 |
| How much Trial Factoring to do? | odin | Software | 4 | 2010-08-08 20:23 |
| Trial factoring | Citrix | Software | 7 | 2004-02-26 03:24 |
| About trial factoring | gbvalor | Math | 4 | 2003-05-22 02:04 |