mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Riesel Prime Search

Reply
 
Thread Tools
Old 2008-05-24, 12:27   #56
em99010pepe
 
em99010pepe's Avatar
 
Sep 2004

1011000011102 Posts
Default

Quote:
Originally Posted by Cruelty View Post
4*3^350767-1 (167359 digits)
You stall the server for 13.86 hours!!! lol
Congratulations.
em99010pepe is offline   Reply With Quote
Old 2008-05-24, 14:00   #57
Cruelty
 
Cruelty's Avatar
 
May 2005

2·809 Posts
Default

Verification took me 32200 seconds on a 3GHz Core2
Cruelty is offline   Reply With Quote
Old 2008-05-30, 05:28   #58
Cruelty
 
Cruelty's Avatar
 
May 2005

31228 Posts
Default Another k=4, b=3 prime

4*3^353635-1 (168728 digits)
Cruelty is offline   Reply With Quote
Old 2008-05-30, 06:01   #59
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2×1,811 Posts
Default

Congrats on yet another one, very close to the one you reported a week ago.
Kosmaj is offline   Reply With Quote
Old 2008-05-30, 12:21   #60
Cruelty
 
Cruelty's Avatar
 
May 2005

110010100102 Posts
Default

Thanks! It's time for k=2 prime
Cruelty is offline   Reply With Quote
Old 2008-06-01, 18:45   #61
em99010pepe
 
em99010pepe's Avatar
 
Sep 2004

B0E16 Posts
Default

Benson prime:

19*2^1684813-1
em99010pepe is offline   Reply With Quote
Old 2008-06-10, 09:05   #62
Cruelty
 
Cruelty's Avatar
 
May 2005

2×809 Posts
Default

Another one from Curtis Cooper
Cruelty is offline   Reply With Quote
Old 2008-06-10, 23:10   #63
Flatlander
I quite division it
 
Flatlander's Avatar
 
"Chris"
Feb 2005
England

31×67 Posts
Default Twin Prime

108615*2^110342+-1 is twin prime!

Comes in at 7th place
Flatlander is offline   Reply With Quote
Old 2008-06-13, 01:09   #64
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2·1,811 Posts
Default

Congrats on a nice twin!

If it's not a secret how many n's did you check? I suppose you used the approach recently suggested by Robert Smith (?) Or, how many LLR tests in total?

Thanks.
Kosmaj is offline   Reply With Quote
Old 2008-06-13, 16:11   #65
Flatlander
I quite division it
 
Flatlander's Avatar
 
"Chris"
Feb 2005
England

31·67 Posts
Default

Quote:
Originally Posted by Kosmaj View Post
Congrats on a nice twin!

If it's not a secret how many n's did you check? I suppose you used the approach recently suggested by Robert Smith (?) Or, how many LLR tests in total?

Thanks.
Thanks Kosmaj.
Well, I'm not sure how much to give away because I intend to search higher and I don't know how much was pure luck and how much was technique.
I suspect a large amount of luck because it was found after just 220,000 candidates and 164 Riesel primes. (Just 10 days on all 4 cores at 3.18GHz, including sieving.)
It's a refinement of this idea:
http://mersenneforum.org/showpost.ph...68&postcount=6

I'm now searching for the No.1 twin until I find one or get bored. Probably the latter.

Chris
Flatlander is offline   Reply With Quote
Old 2008-06-30, 01:44   #66
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2×1,811 Posts
Default

A new k=27 prime by 12121:
27*2^1253870-1 (377454 digits)

Congrats to Frank (L65)!
Kosmaj is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Mersenne Primes p which are in a set of twin primes is finite? carpetpool Miscellaneous Math 3 2017-08-10 13:47
Distribution of Mersenne primes before and after couples of primes found emily Math 34 2017-07-16 18:44
Conjecture about Mersenne primes and non-primes v2 Mickey1 Miscellaneous Math 1 2013-05-30 12:32
A conjecture about Mersenne primes and non-primes Unregistered Information & Answers 0 2011-01-31 15:41
possible primes (real primes & poss.prime products) troels munkner Miscellaneous Math 4 2006-06-02 08:35

All times are UTC. The time now is 03:47.

Sat Jun 6 03:47:54 UTC 2020 up 73 days, 1:20, 0 users, load averages: 1.42, 1.24, 1.24

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.