Hey everyone,

I love science and research in my personal / professional life and at BOINC.
Quite a while back I used two old computers in the workgroup at uni to find prime numbers in the prpnet-project. I found quite a lot of the small b*2^n+1 (n ~ 50000) prime numbers, since the check even at those old machines only took about 10-20 sec :)

Now I am wondering if there is another project out there with small "insignificant" primes or other scientific relavant tests to preform with similar short workunits? Does anybody know of a project that meets this criteria?
It is not the fame I am after, it is more the urge to help science / complete something etc. with the little computing power I have (1 Machine). Surely my contribution to primegrid helps, but is rater insignificant compared to "the big guys". And although I am crunshing my workunits at primegrid no matter what, it would be nice to find something once in a while :) Therefore the search for a small side project.

Any suggestions are welcome.

kind regards

some-one

Hi some-one,

There is a side project looking for GFN-13 and GFN-14 primes on a server operated by Stream. Here is the link to the instructions on how to participate: http://www.primegrid.com/forum_thread.php?id=7985. They are also looking for the first GFN-16 prime with 1,000,000 digits if you are interested in that.

Regards,
Kellen

P.S. I also had the same thoughts you did about small primes that are "insignificant" but still have scientific value and embarked upon a bit of a search over the past month or so. I will get some results together and post more later today :)

Hi again some-one,

I should also mention that if you want to look for primes on your own you can do it relatively easily and find some in any size range you choose. Using the programs NewPGen (https://primes.utm.edu/programs/NewPGen/) and LLR (http://jpenne.free.fr/index2.html) you can sieve and test pretty much anything you want. Just pick an exponent and a range of k-values to sieve with NewPGen and then feed the sieve output file into LLR. If you want to look for 100,000 digit primes use exponent 2^332180 or higher with k-values over 10000 and you should be good.

PrimeGrid is searching all k-values less than 10000, but I think if you go above that then you are probably not searching a range which is actively being searched by others, but someone can correct me if I am wrong.

Enjoy!

Kellen

@Kellen:
Thanks for the quick reply.
The suggested project seems interesting. To register I need a invitation code though.

Maybe I choose the wrong word when I said "insignificant". Surely the small numbers are scientifically interessting, but they will not be listed in Chris Caldwell's database ;)

The manual sieving and testing process sounds interesing too. But before I start I have to do some reading and testing ;)

some-one

Looks like I had the same thoughts as both mackerel and some-one, but started a little smaller than mackerel :)

http://www.primegrid.com/forum_thread.php?id=9046

With my limited knowledge, the (official) subproject that finds the smallest primes would be the Sophie Germain Search and the GFN-15 search, running on CPU and GPU respectively.
I personally enjoy SGS, it's a very good way for my older machines to find primes, and there's a very small chance a prime you find could be a twin prime, which you get a cool badge for discovering.

Hey,

for now I am participating at the GFN-13 / 14 project ! Thanks for the suggestion.

The though that I search a range for prime numbers myself (have not decided on the form yet) is very appealing though, but I have to do some serious research about the number ranges of different projects. I do not want to overlap with other projects.

Thanks for all the suggestions.