mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2019-04-28, 02:43   #1
__HRB__
 
__HRB__'s Avatar
 
Dec 2008
Boycotting the Soapbox

24·32·5 Posts
Default 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).
__HRB__ is offline   Reply With Quote
Old 2019-04-28, 05:47   #2
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

918210 Posts
Default

Factors will be = s*2n+1+1.
Batalov is offline   Reply With Quote
Reply

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

All times are UTC. The time now is 01:52.

Thu Dec 3 01:52:04 UTC 2020 up 83 days, 23:03, 1 user, load averages: 2.64, 2.47, 2.14

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.