mersenneforum.org  

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

Reply
 
Thread Tools
Old 2006-02-08, 18:42   #177
lsoule
 
lsoule's Avatar
 
Nov 2004
California

23·3·71 Posts
Default

I sieved up to 700bn and only had 840 candidates per 100k. Along with
that low # of candidates per thousand is a low # of primes. The risk
of a really low-weight k like this is that you won't find *any* primes.
To find the low-weight k's for k<300, I sieved n=0-10k up to 100M.
Below is the number of candidates left, # of primes in n=0-5k, and K

Code:
Weight   Primes     K
186	7	283
185	6	269
178	7	101
176	4	29
169	6	221
146	4	251
145	8	223
130	2	239
117	3	191
116	3	127
107	5	247
53	3	253
For comparison, K=25 had 582 candidates left and 21 primes. The highest
weight was K=195 with 1466 candidates and 37 primes.
lsoule is offline   Reply With Quote
Old 2006-02-08, 20:06   #178
amphoria
 
amphoria's Avatar
 
"Dave"
Sep 2005
UK

23×347 Posts
Default

From test your own k:

5169615*2^294163-1 (88559 digits)
amphoria is offline   Reply With Quote
Old 2006-02-09, 04:00   #179
lsoule
 
lsoule's Avatar
 
Nov 2004
California

23·3·71 Posts
Default

From choose your own k - the 5th reported prime for this k
22932195*2^313832-1 (94481 digits)
lsoule is offline   Reply With Quote
Old 2006-02-10, 01:22   #180
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2×1,811 Posts
Default Megabit

My first megabit prime

77*2^1467554-1 (441780 digits)

After realizing that k=77 is a promising multiplier, and finding the primes at 607k (in December 2004) and 855k (in June last year) I decided to test megabit candidates working from 1M forward and from 1.5M backward. It was a time consuming "operation" but it payed off!
Kosmaj is offline   Reply With Quote
Old 2006-02-10, 02:27   #181
grobie
 
grobie's Avatar
 
Sep 2005
Raleigh, North Carolina

337 Posts
Default

WTG, very nice
grobie is offline   Reply With Quote
Old 2006-02-10, 06:43   #182
Cruelty
 
Cruelty's Avatar
 
May 2005

110010110002 Posts
Default

Great prime Kosmaj!
Cruelty is offline   Reply With Quote
Old 2006-02-10, 13:40   #183
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2·1,811 Posts
Default

Grobie and Cruelty, thanks!

Here is one more big one
2995125705*2^891645-1 (268422 digits)

This one eluded us for quite a while! And it closely matches Larry's forecast (890k) based on previous largest gap.
Kosmaj is offline   Reply With Quote
Old 2006-02-10, 14:39   #184
lsoule
 
lsoule's Avatar
 
Nov 2004
California

23·3·71 Posts
Default

Great primes Kosmaj!

This is the new largest gap. Duplicating the largest gap would have put this prime at n=891578!
lsoule is offline   Reply With Quote
Old 2006-02-10, 14:43   #185
lsoule
 
lsoule's Avatar
 
Nov 2004
California

23×3×71 Posts
Default

BTW, this puts our project score ahead of 15k already. Now #3 in primes
and #10 in score.
lsoule is offline   Reply With Quote
Old 2006-02-10, 16:02   #186
lsoule
 
lsoule's Avatar
 
Nov 2004
California

170410 Posts
Default

80555475*2^281095-1 (84626 digits)
lsoule is offline   Reply With Quote
Old 2006-02-12, 01:23   #187
grobie
 
grobie's Avatar
 
Sep 2005
Raleigh, North Carolina

1010100012 Posts
Default

1222853775*2^249279-1 (75050 digits)
grobie is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
POST LOTS AND LOTS OF PRIMES HERE Kosmaj Riesel Prime Search 1966 2021-06-27 11:11
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 23:27.


Fri Aug 6 23:27:01 UTC 2021 up 14 days, 17:56, 1 user, load averages: 3.74, 4.01, 4.03

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.