mersenneforum.org  

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

Reply
 
Thread Tools
Old 2008-10-15, 05:19   #1145
Cruelty
 
Cruelty's Avatar
 
May 2005

23·7·29 Posts
Default

Congratulations AES!!!
Cruelty is offline   Reply With Quote
Old 2008-10-15, 07:12   #1146
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

10010010000112 Posts
Default

Some bigbig primes afoot. I feel so behind!
congrats, adam. You've searched a huge range to find that one.
-Curtis
VBCurtis is offline   Reply With Quote
Old 2008-10-15, 18:30   #1147
AES
 
Jul 2007
Tennessee

25×19 Posts
Default

1977*2^723820-1 (217895 digits)
AES is offline   Reply With Quote
Old 2008-10-20, 07:29   #1148
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

2×1,439 Posts
Default

19709699*2^1521540-1 is prime.
My first M-Bit! Rank 97 on Top5000 and place 8 on RPS highest.

Last fiddled with by kar_bon on 2008-10-20 at 07:31
kar_bon is offline   Reply With Quote
Old 2008-10-20, 09:18   #1149
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2×1,811 Posts
Default

Hey Karsten, that's a BIG one!

Congratulations!
Kosmaj is offline   Reply With Quote
Old 2008-10-20, 10:52   #1150
Cruelty
 
Cruelty's Avatar
 
May 2005

23×7×29 Posts
Default

Congratulations kar_bon!
BTW: What is the weight of this "k"?
BTW2: we are almost back at #4 in terms of score!
Cruelty is offline   Reply With Quote
Old 2008-10-20, 11:24   #1151
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

B3E16 Posts
Default

Quote:
Originally Posted by Cruelty View Post
BTW: What is the weight of this "k"?
k=19709699 has a Nash weight of 26.
see www.rieselprime.org in the Data Section and the 10^7-10^8 range.
all listed k's are given with their Nash-weight there on all data pages.
there are many others not searched yet or at lower levels.
please report the searched ranges if you try one of these!
i'm planning to include much more low weight k's in the future.
kar_bon is offline   Reply With Quote
Old 2008-10-20, 19:44   #1152
segmtfault
 
segmtfault's Avatar
 
Jun 2004
California

277 Posts
Default

From the 6th drive: 259*2^914173-1 (275196 digits)
segmtfault is offline   Reply With Quote
Old 2008-10-20, 20:31   #1153
amphoria
 
amphoria's Avatar
 
"Dave"
Sep 2005
UK

2×19×73 Posts
Default

From the 6th drive:

203*2^859602-1 (258769 digits)
amphoria is offline   Reply With Quote
Old 2008-10-21, 16:40   #1154
Cruelty
 
Cruelty's Avatar
 
May 2005

23·7·29 Posts
Default

Finally some good news from a high-weight front: 736320585*2^856778-1 (257925 digits)
Cruelty is offline   Reply With Quote
Old 2008-10-22, 12:50   #1155
Flatlander
I quite division it
 
Flatlander's Avatar
 
"Chris"
Feb 2005
England

31·67 Posts
Default

5733*2^365971-1 is prime.

I am testing the following ks from n=350,000 and up:
1401, 1403, 1407, 1413, 1419, 1431, 1433, 1435, 1437, 1441, 1445, 1449, 1459, 1467, 1473, 1479, 1483, 1487, 1489, 1491, 1493, 1495, 1497
(Only tested to 351,795.)

3087, 3969, 4851, 5733, 6615
(Tested to 366,400.)

Chris
Flatlander is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
POST LOTS AND LOTS OF PRIMES HERE Kosmaj Riesel Prime Search 1958 2021-02-11 06:55
Inefficient behaviour in yafu when doing large NFS with lots of threads 2147483647 YAFU 3 2016-12-25 21:44
Lots of roundoff errors TheMawn Software 18 2014-08-16 03:54
lots of large primes Peter Hackman Factoring 2 2008-08-15 14:26
How do I get computer to do lots of little tasks? jasong Information & Answers 4 2007-10-04 20:40

All times are UTC. The time now is 01:27.

Fri Mar 5 01:27:07 UTC 2021 up 91 days, 21:38, 0 users, load averages: 2.54, 2.45, 2.62

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.