|
2012-07-27, 10:34
|
#34 |
|
Romulan Interpreter
"name field"
Jun 2011
Thailand
41·251 Posts |
I didn't want to go so much in details and confuse the man. :D
Oliver said few times that the exponent is limited to 32 bits, does it matter? For higher, use Factor5 or so. I was one of the guys asking long ago about factoring OBD exponents, and got reply from Uncwilly about Factor5, the discussion is somewhere around. edit @Dubslow: size of k does not limit the size of the expo. When expo gets higher, k gets smaller. The factor candidate has to fit the barret/whatever/kernel when squared mod factor. The expo is just a string of bits which says how many times you do the square-shift trick. Last fiddled with by LaurV on 2012-07-27 at 10:39 |
|
|
|
2012-07-27, 10:41
|
#35 | |
|
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
3×29×83 Posts |
Quote:
 Yeah, I screwed up. Too lazy to care though. |
|
|
|
|
 |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| SievePrimes is too big for the current assignment | mattmill30 | GPU to 72 | 21 | 2017-02-01 00:20 |
| 4000 < k < 5000 | otutusaus | Riesel Prime Data Collecting (k*2^n-1) | 5 | 2012-03-07 20:01 |
| 5000 < k < 6000 | justinsane | Riesel Prime Data Collecting (k*2^n-1) | 26 | 2010-12-31 12:27 |
| Factoring on a 5000+ | jasong | Hardware | 3 | 2006-06-17 08:50 |
| Top-5000 List | edorajh | Riesel Prime Search | 17 | 2006-03-28 21:57 |
