mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Riesel Prime Search (https://www.mersenneforum.org/forumdisplay.php?f=59)
-   -   Other Primes (https://www.mersenneforum.org/showthread.php?t=6374)

Kosmaj 2007-01-26 01:37

New record Woodall :surprised What a surprise! :shock:

[URL="http://primes.utm.edu/primes/page.php?id=79267"]1268979*2^1268979-1 [/URL] (382007 digits)

Discovered by W. Siemelink using LLR (L201). Congrats!

Cruelty 2007-02-14 22:02

Check [URL="http://primes.utm.edu/primes/page.php?id=79378"]this[/URL] out. [B]k>60bit[/B] found using [B]LLR[/B]

m_f_h 2007-03-15 17:40

I hope my post won't clutter up this thread too much ; my excuses in advance if so, and moderators, please move it to wherever it should be if this place is not OK !
I just discovered the existence of LLR.
Is the search for GM's somewhere somehow coordinated ?
(People declaring to search some ranges...)
To what extend are the gmfcandidates prefactored or elsehow selected ?
I just ran llr somehow randomly on such a candidate and it IMMEDIATELY (time << 1 second) found a factor (2^16666417-...+1 has factor 18068995989053)
- how comes that this easy finding is not mentioned in the gmfcand... file while other bigger factors are there ?
Again sorry for my ignorance and maybe inappropriate posting...
PS: the llr program does not seem to write a save file when it's killed, like mprime...?

Cruelty 2007-03-15 23:13

gmfcandidates is prefactored to 32 bits for both GM and GQ, meaning that only if a factor is found for both such an exponent has been eliminated... however by default LLR will look only for GMs so only GM factors will be reported. Check out LLR documentation for details.

BTW: when exiting LLR it will always save it's current progress.

Cruelty 2007-06-08 08:35

[URL="http://primes.utm.edu/primes/page.php?id=80955"]New Woodall record [/URL] :tu:

Siemelink 2007-06-08 09:43

[QUOTE=Cruelty;107914][URL="http://primes.utm.edu/primes/page.php?id=80955"]New Woodall record [/URL] :tu:[/QUOTE]

I am very happy. I've found now two Woodall primes in 10 months. Allthough the first two months I was unaware that they are called Woodall primes and that I wasn't the first to think of their special form n*2^n-1.

Willem.

Cruelty 2007-06-08 13:07

Congratulations!!!

Kosmaj 2007-06-27 06:39

Jeff (L399) of TPS dumped alone about 60 primes at n=333,333 yestreday :shock: One more such dump and he will be in top-10 by number! :w00t:

Kosmaj 2007-07-21 22:10

Congrats to Maks and his son on new largest repunit PRP:

(10^270343-1)/9

Cruelty 2007-08-04 20:31

3 Generalized Fermat primes have been reported under an anonymous account [URL="http://primes.utm.edu/primes/page.php?id=81870"]first[/URL], [URL="http://primes.utm.edu/primes/page.php?id=81869"]second[/URL], [URL="http://primes.utm.edu/primes/page.php?id=81868"]third[/URL] - congrats!

VBCurtis 2007-08-05 03:07

Those 3 are a pretty fortunate grouping! I'd ask "what are the chances?", but knowing this forum, someone would actually calculate it. :rolleyes:

Anyone know if primality testing generalized fermats is faster or slower than LLR for same-size riesel numbers?

-Curtis


All times are UTC. The time now is 23:37.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.