amount of memory needed for Stage 2 (factor) - Page 2

eepiccolo · 2003-03-18, 19:14

Well, gee

. While we're at it :D , how about an explination of how the memory requirements are calculated? I mean, details, rather than just saying it is related to how many temporaries there are.

cheesehead · 2003-03-18, 19:25

Quote:

Originally Posted by eepiccolo

Well, gee

. While we're at it :D , how about an explination of how the memory requirements are calculated? I mean, details, rather than just saying it is related to how many temporaries there are.

Go read the source code yourself! ;)

Even llamas have their llimits. I'm outta here ... :D

eepiccolo · 2003-03-18, 19:54

.

OK, here I go again...
On the math page at mersenne.org, it says the P-1 stage 2 works such that it will find a factor q, where q= 2*k*p+1, if k is composite, and all of the factors of k are less than B1 except for one factor, and that one factor is between B1 and B2.
So because more memory makes finding a factor in stage 2 more likely, does that mean that more memory just allows an increase in B2, or is there even something else going on?

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
amount of memory when P-1 factoring	wildrabbitt	Hardware	3	2015-03-11 16:41
Stage 2 Memory Setting - Again	Antonio	Software	6	2012-09-04 12:48
Improvement suggestions / Memory amount & Prime95	Brain	Software	2	2010-04-12 09:20
Predicting the Amount of CPU Power Needed to LL Test Exponent p	jinydu	Math	19	2005-02-07 02:52
Choosing amount of memory	azhad	Software	2	2004-10-16 16:41

2003-03-18, 19:14	#12
eepiccolo Dec 2002 Frederick County, MD 2×5×37 Posts	Well, gee . While we're at it :D , how about an explination of how the memory requirements are calculated? I mean, details, rather than just saying it is related to how many temporaries there are.

2003-03-18, 19:54	#14
eepiccolo Dec 2002 Frederick County, MD 2·5·37 Posts	. OK, here I go again... On the math page at mersenne.org, it says the P-1 stage 2 works such that it will find a factor q, where q= 2kp+1, if k is composite, and all of the factors of k are less than B1 except for one factor, and that one factor is between B1 and B2. So because more memory makes finding a factor in stage 2 more likely, does that mean that more memory just allows an increase in B2, or is there even something else going on?