mersenneforum.org  

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

Reply
 
Thread Tools
Old 2012-03-12, 02:22   #1
137ben
 
Mar 2012

7 Posts
Default What about double-checking TF/P-1?

While it is possible for an error in a TF to "miss" a found factor, it probably isn't worth the effort to double check. However, it may well be worth checking that found factors are actually factors, to be sure that we don't miss any Mersenne primes. It would be a lot easier that the initial round of trial factoring, because we would only need to check TF assignments for which a found factor was reported. Since this is relatively rare, (and in fact, TF jobs in which factors are found tend to take much less time than those which find no factors), it shouldn't take very much effort to do, and it helps ensure that we do not miss any primes.
So, anyone else think this is a good idea?
137ben is offline   Reply With Quote
Old 2012-03-12, 04:18   #2
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

22×3×739 Posts
Default

There is NO EFFORT needed to check a factor. The process is straight forward and it is done automatically by the server. Imagine you want to factor 123509 using only pencil and paper, it will take you a while and your only perspective would be to check all primes below 350 or so, but if I tell you that 113 is a factor, you will not need more then few seconds to say if that is true or not. Checking if some x is a factor of some y need no effort. The problem is that these possible x-es are sooooo many, and we have difficulties to "choose" the right one...
LaurV is offline   Reply With Quote
Old 2012-03-12, 04:50   #3
Xyzzy
 
Xyzzy's Avatar
 
"Mike"
Aug 2002

5·23·67 Posts
Default

An old thread:

http://www.mersenneforum.org/showthread.php?t=1085
Xyzzy is offline   Reply With Quote
Old 2012-03-12, 22:14   #4
Mini-Geek
Account Deleted
 
Mini-Geek's Avatar
 
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

17×251 Posts
Default

Quote:
Originally Posted by LaurV View Post
There is NO EFFORT needed to check a factor.
To be technically correct: The effort needed to check a factor [of a typical Mersenne number GIMPS handles] is trivial, but not zero.

Last fiddled with by Mini-Geek on 2012-03-12 at 22:15
Mini-Geek is offline   Reply With Quote
Old 2012-03-12, 22:26   #5
davieddy
 
davieddy's Avatar
 
"Lucan"
Dec 2006
England

6,451 Posts
Default Is this Pussy Heaven?

Not Roy Orbison or Dennis Hopper

David

Or even this:
Mr Sandman

Even Homer nods

Last fiddled with by davieddy on 2012-03-12 at 22:34
davieddy is offline   Reply With Quote
Old 2012-03-13, 00:11   #6
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

8,731 Posts
Default

Quote:
Originally Posted by Mini-Geek View Post
To be technically correct: The effort needed to check a factor [of a typical Mersenne number GIMPS handles] is trivial, but not zero.
Vanishingly small, might be a better term.
Uncwilly is offline   Reply With Quote
Old 2012-03-13, 04:01   #7
Christenson
 
Christenson's Avatar
 
Dec 2010
Monticello

24×107 Posts
Default

How about the amount of computational effort to check a found factor is on the same order of effort as transmitting it over the internet and receiving it at the server.
Christenson is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Double checking gd_barnes Riesel Prime Search 61 2020-10-22 23:26
Double checking of Results pinhodecarlos Prime Gap Searches 13 2017-12-09 06:07
Double checking Unregistered Information & Answers 19 2011-07-29 09:57
Double-checking milestone? jobhoti Math 17 2004-05-21 05:02
Any glory in double checking? Quacky Lounge 5 2003-12-03 02:20

All times are UTC. The time now is 11:39.

Sun Oct 25 11:39:47 UTC 2020 up 45 days, 8:50, 0 users, load averages: 1.49, 1.73, 1.57

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.