20120623, 03:13  #1 
2×3,167 Posts 
Best Work for Finding Primes
Hello,
Right now I have my computers "trial factoring to low limits" by using the "LucasLehmer test." I don't know what any of that means to be quite honest but I just wanted to make sure I'm doing the right thing so I can help test a new prime! Sorry to be a bother but just making sure. Is there anything else I should be doing? Thanks! 
20120623, 10:08  #2 
Dec 2009
Peine, Germany
513_{8} Posts 
Welcome
Trial factoring (TF) is a preliminary step that eliminates possible candidates by finding small factors. Factor found = not prime.
For proving a prime you must run "first time Lucas Lehmer tests" (LL) which you seem to have demanded from Prime95. But if your PC is relatively slow PrimeNet will assign less demanding work (for example TF). Could you add your PC's hardware? Last but not least: Welcome to the fun world of finding primes and factors. 
20120623, 11:02  #3 
"Brian"
Jul 2007
The Netherlands
2·23·71 Posts 
Just to add to what Brain writes:
Trial factoring, and LucasLehmer testing, are two necessary types of work. They are not the same, and there are other work types as well. You can set a work type preference if you wish on your PrimeNet account to choose what you want to do, or you can simply select the "what makes sense" option which will make PrimeNet decide what work to give you on the basis of your hardware's particular strengths plus what the project most needs at the moment. If you want to choose your own work type, and if you want a chance of discovering a mersenne prime yourself then, as Brain says, first time LL testing is the way to go. (DC, which is doing an LL test that someone else has already done as a double check, provides a smaller chance of discovering a prime too.) An LL test will take weeks or months, though. Factoring work is faster, just as important to the project, and much more likely to give a positive result (factor found); but it will not lead to you being the discoverer of a new prime. 
20120623, 12:57  #4  
"Forget I exist"
Jul 2009
Dumbassville
2^{6}×131 Posts 
Quote:


20120623, 16:52  #5 
1110101000100_{2} Posts 
Okay thank you. When I go to test > status it says that both workers are doing LucasLehmer test so from what I now understand, that's good! I have a 2.4 Ghz Intel Core 2 Duo. I think I'm good then if I'm not mistaken.

20120623, 16:54  #6 
2^{2}×3×5×59 Posts 

20120624, 03:47  #7  
"Lucan"
Dec 2006
England
2·3·13·83 Posts 
Quote:
Either the number is prime or it's composite, but if composite gives no indication as to what the factors are. (Although one might conjecture that the actual nonzero residue could potentially help in finding the factors). It is worth checking for factors below 2^73. GIMPS typically searches up to 2^71, because of an administrative cockup. 

20120624, 12:29  #8 
"Forget I exist"
Jul 2009
Dumbassville
2^{6}×131 Posts 
funny you say that because I've brought a way up before, I believe. it's just I'm almost positive it's more expensive than TF. PM me if you want details.

20120624, 13:26  #9 
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 89<O<88
3×29×83 Posts 
EWMayer has explicitly said that the (full) residue can be used to effect a primality test on the cofactor after finding a first factor.

20120624, 13:50  #10  
"Forget I exist"
Jul 2009
Dumbassville
2^{6}×131 Posts 
Quote:
788%23 = 6 =((194%23)^22)%23 since these equal 23 is a factor of m*y at least and in this case a factor of m. Last fiddled with by science_man_88 on 20120624 at 13:58 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Choose your own K and work on finding a top5000 prime!  lsoule  Riesel Prime Search  334  20200404 23:22 
Finding VERY large primes  c10ck3r  Information & Answers  34  20120829 16:47 
Finding primes using modular stacking  goatboy  Math  1  20071207 12:30 
Finding primes from 1 upwards  henryzz  Lounge  35  20071020 03:06 
Finding primes with a PowerPC  rogue  Lounge  4  20050712 12:31 