mersenneforum.org  

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

Reply
 
Thread Tools
Old 2010-06-13, 04:38   #1
h201006
 
Jun 2010

2 Posts
Smile what is the meaning of "Unverified LL"

Could anyone tell me what is the meaning of "Unverified LL"? Does this means that it has been Lucas-Lehmer Primality test, and it need a double check? Thanks. A example is as follow:
40000313No factors below2^68
P-1B1=455000, B2=7735000
Unverified LLBFBBD21F9607BB__ by "Frank Hornung"
h201006 is offline   Reply With Quote
Old 2010-06-13, 09:18   #2
S485122
 
S485122's Avatar
 
Sep 2006
Brussels, Belgium

13×131 Posts
Default

Yes an the Mersenne number with that exponent has been tested once with the with Lucas-Lehmer primality test. Since it is the first result of that test reported to the server it is un unverified test. I a second test confirms the Res64 residue with a different shift it will be considered checked. You can find on the Maths page on the GIMPS site, on this forum and in the Mersenne wiki.

Jacob
S485122 is offline   Reply With Quote
Old 2010-06-13, 10:13   #3
h201006
 
Jun 2010

28 Posts
Default

Thank you
h201006 is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Stockfish game: "Move 8 poll", not "move 3.14159 discussion" MooMoo2 Other Chess Games 5 2016-10-22 01:55
Aouessare-El Haddouchi-Essaaidi "test": "if Mp has no factor, it is prime!" wildrabbitt Miscellaneous Math 11 2015-03-06 08:17
What does "Unverified LL" mean? LiquidNitrogen Information & Answers 7 2011-07-04 11:17
Would Minimizing "iterations between results file" may reveal "is not prime" earlier? nitai1999 Software 7 2004-08-26 18:12

All times are UTC. The time now is 17:00.


Mon Aug 2 17:00:29 UTC 2021 up 10 days, 11:29, 0 users, load averages: 2.74, 2.40, 2.25

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.