![]() |
N-1 Broken?
N-1 Proofs are not working. For example, [URL="http://factordb.com/index.php?id=1100000000537223259"]this number[/URL] should be provable. Also [URL="http://factordb.com/index.php?id=1100000000537223328"]this one[/URL] and [URL="http://factordb.com/index.php?id=1100000000537223335"]this one[/URL].
While fixing it, maybe we can get this [URL="http://factordb.com/index.php?id=1100000000212962539"]older problem[/URL] fixed? |
Still Broken. I haven't seen an N-1/N+1 proof work since the head post. [URL="http://factordb.com/index.php?id=1100000000539041762"]Here[/URL] is one from today.
|
It appears Syd is still very busy.
I see this as very unfortunate. There are (currently) only four workers and one is dedicated to - Primality tests, N-1/N+1 tests. Which doesn't seem to work. No worker is processing the Primo verification queue and the worker for Status Unknown has limited itself to just below the current threshold. Only four workers and it appears two are doing nothing while other queues continue to build. How sad. |
N+1 is broken too. Why?
The cofactor of this number needs an N+1 proof: [URL]http://www.factordb.com/index.php?id=1100000000542801209[/URL]
Output from DB: [CODE]Primality testing 39032298869983378572165251709817898784122941782107130404355699668791809608361716288453210077407142417063406328932577136081823687995007860164492251306615896288859737799407184033891234625746937885535475345604467426030303562169259294951667862679970594724619504208828105984380587624680857390191907845313145439518452401 [N+1, Brillhart-Lehmer-Selfridge][/CODE] |
N-1/N+1 should now be working.
Thanks to [B]Syd[/B] for isolating the problem. Thank to [B]rogue[/B] for fixing it so quickly as noted [URL="http://mersenneforum.org/showpost.php?p=319958&postcount=136"]here[/URL]. |
| All times are UTC. The time now is 12:20. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.