20190428, 02:43  #1 
Dec 2008
Boycotting the Soapbox
2^{4}·3^{2}·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 32bit number, and m ~ n. The idea is to use Proth's theorem for a primality check and do convolutions using SchoenhageStrassen with carries in base(k*2^m). 
20190428, 05:47  #2 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
9909_{10} Posts 
Factors will be = s*2^{n+1}+1.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Dumb sieving question  fivemack  Software  7  20171127 22:48 
Line sieving vs. lattice sieving  JHansen  NFSNET Discussion  9  20100609 19:25 
A question on lattice sieving  joral  Factoring  5  20080403 08:01 
Sieving question  jasong  Sierpinski/Riesel Base 5  9  20070723 00:03 
Sieving vs. LLR  Cruelty  Riesel Prime Search  12  20060727 09:10 