|
2019-04-28, 02:43
|
#1 |
Dec 2008
Boycotting the Soapbox
24·32·5 Posts |
Sieving Question
What advanced knowledge do we have about the factors of the following numbers?
P = (k*2^m)^(2^n)+1 where k is an odd 32-bit number, and m ~ n. The idea is to use Proth's theorem for a primality check and do convolutions using Schoenhage-Strassen with carries in base-(k*2^m). |
|
|
|
2019-04-28, 05:47
|
#2 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
990910 Posts |
Factors will be = s*2n+1+1.
|
|
|
|
 |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Dumb sieving question | fivemack | Software | 7 | 2017-11-27 22:48 |
| Line sieving vs. lattice sieving | JHansen | NFSNET Discussion | 9 | 2010-06-09 19:25 |
| A question on lattice sieving | joral | Factoring | 5 | 2008-04-03 08:01 |
| Sieving question | jasong | Sierpinski/Riesel Base 5 | 9 | 2007-07-23 00:03 |
| Sieving vs. LLR | Cruelty | Riesel Prime Search | 12 | 2006-07-27 09:10 |
