mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 5 of 5
Search took 0.01 seconds.
Search: Posts Made By: kar_bon
Forum: Riesel Prime Data Collecting (k*2^n-1) 2010-11-25, 13:39
Replies: 6
Views: 6,046
Posted By kar_bon
Sorry, corrected!

Sorry, corrected!
Forum: Riesel Prime Data Collecting (k*2^n-1) 2010-11-25, 12:44
Replies: 6
Views: 6,046
Posted By kar_bon
No, only collecting Proth-Primes, too, because...

No, only collecting Proth-Primes, too, because those data are not shown anywhere.

W.Keller's pages contain only data for k<1200 and seem also a bit out of date.

The current work at PrimeGrid on...
Forum: Riesel Prime Data Collecting (k*2^n-1) 2010-11-24, 00:10
Replies: 6
Views: 6,046
Posted By kar_bon
I've finished the range 1200<k<10000 and n<50000....

I've finished the range 1200<k<10000 and n<50000.

PrimeGrid finished the range 1200<k<10000 and 50000<k<100000 and started (for the same k-range) 100000<k<200000.
Forum: Riesel Prime Data Collecting (k*2^n-1) 2010-11-04, 18:15
Replies: 6
Views: 6,046
Posted By kar_bon
I've included Status pages for three different...

I've included Status pages for three different k-ranges and n-ranges (smaller k-values -> higher n-values).

All current reservations from W.Keller's page are shown (from Feb.2009 till Nov.2010)....
Forum: Riesel Prime Data Collecting (k*2^n-1) 2010-10-28, 16:49
Replies: 6
Views: 6,046
Posted By kar_bon
(NEW) Proth Primes Section

Here's a great update of my Online Database: now including pages for Proth-Primes, too.

Some data:

- all primes listed on W.Keller's page (www.prothsearch.net) for k<1200
- all reservations...
Showing results 1 to 5 of 5

 
All times are UTC. The time now is 12:20.

Mon Apr 19 12:20:32 UTC 2021 up 11 days, 7:01, 0 users, load averages: 1.96, 2.09, 2.01

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.