> I've just finished trying to factor F24 using the P-1 method > with a bound #1 of 1,000,000. No factor was found. > Unfortunately, I do not have enough memory to run stage 2. > So, is there a volunteer that would be willing to run stage 2 on > their computer. It will take about 3 weeks. You need 256MB of memory. > The program will use 100 MB of that for the full 3 weeks. How does the stage 2 of P-1 work? Why does it require more memory? How do you know how long it will take if you don't even know what speed of computer is being used? :) The only references that I've seen to it say that it involves random walks and the birthday paradox. Can anyone point me to any online resources? (Library is closed for a week in preparations for the start of a new semester) Thank you, Lucas _________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
