mersenneforum.org  

Go Back   mersenneforum.org > New To GIMPS? Start Here! > Information & Answers

Reply
 
Thread Tools
Old 2011-08-09, 18:53   #1
Unregistered
 

22·3·773 Posts
Default when does prime seach stop?

Hello.
The 4 nubers i´m working with are near 80% checked.
Does prime95 go on until 100% anyway or does it stop when the first multiplicator is found?
Thx for every answer
Simon
  Reply With Quote
Old 2011-08-09, 20:22   #2
davieddy
 
davieddy's Avatar
 
"Lucan"
Dec 2006
England

2×3×13×83 Posts
Default

Are you factoring or LL testing?
davieddy is offline   Reply With Quote
Old 2011-08-09, 20:39   #3
Unregistered
 

732110 Posts
Default

I´m LL-testing
  Reply With Quote
Old 2011-08-09, 23:16   #4
Christenson
 
Christenson's Avatar
 
Dec 2010
Monticello

34038 Posts
Default

Given that you are 80% complete on your 4 exponents, and that you continue to run prime95 (or mprime), each of these exponents will finish in due time and their residues will be reported to the server and you will be able to find your name on the "top producers" list with an appropriate number of GHz-Days. Depending on how much work you want queued up at once (under options/CPU I think), a few days before each LL (or other) test completes, prime95 will contact the server and ask it for more assignments (using the worker/preferences option to decide what type), and then, when each assignment is complete, start the new assignment.

There is a slight chance (1 in 400,000) that a meteor lands on your computer and you have found the next Mersenne prime when one of those tests completes (assuming its a first-time LL test and not a double-check LL test), in which case a modicum of fame and a small amount of cash will begin moving in your direction, and the people in charge will run a double-check on your result.

This process ends when you stop it -- there are literally millions of assignments available, and plenty of other creative ways to use your CPU and/or GPU in the service of number theory to be found on this forum.

Enjoy!
Christenson is offline   Reply With Quote
Old 2011-08-09, 23:31   #5
Brian-E
 
Brian-E's Avatar
 
"Brian"
Jul 2007
The Netherlands

326910 Posts
Default

Quote:
Originally Posted by Unregistered View Post
Does prime95 go on until 100% anyway or does it stop when the first multiplicator is found?
Quote:
Originally Posted by Unregistered View Post
I´m LL-testing
It continues to 100%. The test is not looking for factors but merely determining if the number is prime or composite, and the answer to this question is not determined until the test is 100% complete.
See http://www.mersennewiki.org/index.php/Lucas-Lehmer_test for more information.
Brian-E is offline   Reply With Quote
Old 2011-08-10, 01:38   #6
Christenson
 
Christenson's Avatar
 
Dec 2010
Monticello

5×359 Posts
Default

Thanks Brian....

Other types of tests(TF - Trial Factoring, P-1, and ECM) do stop after finding the first factor when they do find factors; on average, they don't find factors and run to completion but they do so often enough that they reduce the total amount of LL testing required.
Christenson is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Prime generating polynomials that stop? Orgasmic Troll Math 61 2017-04-05 19:28
LLR 3.8.2: more flexible stop-on-prime option mdettweiler Conjectures 'R Us 21 2010-10-03 13:38
Start and Stop Prime 95 on Large Groups of Windows XP Machines MarcGetty Software 3 2006-03-07 07:54
Should we stop at k=249? jocelynl 15k Search 2 2004-07-10 13:31
RMA - stop LLR bug paulunderwood 3*2^n-1 Search 8 2004-05-19 07:10

All times are UTC. The time now is 10:24.


Tue Jul 27 10:24:13 UTC 2021 up 4 days, 4:53, 0 users, load averages: 1.42, 1.74, 1.84

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.