Go Back > Prime Search Projects > Riesel Prime Search

Thread Tools
Old 2010-03-22, 13:08   #1
robert44444uk's Avatar
Jun 2003
Oxford, UK

111100101102 Posts
Default Possible new project for RPS

For the last 6 months, Thomas 11, Henryzz and I, using R Gerbicz's custom software, have found approx 5,000 k values which have 100 primes or more at n=10,000

We are taking the better values up to around n=150,000 at which stage some of the k will have 160 primes or more

We are planning to take about 10-12 of the best from this level upwards in a drive to first, break the world record of 169 primes known for a k, and second, to push on to find a k with 200 primes by n=1,000,000.

We expect we will be ready to start this drive in about 6 weeks. We were enquiring to see whether RPS members are interested in placing some resources (sieving and testing) to help out.

For details of progress see Mersennefoum "other stuff" "open projects" "very prime Riesel and Sierpinski k"

Comments are very welcome.
robert44444uk is offline   Reply With Quote
Old 2010-04-30, 22:01   #2
science_man_88's Avatar
"Forget I exist"
Jul 2009

26×131 Posts

I'm not very good for resources but if the science_man_88 thread can help in any way message me :(
science_man_88 is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Special project #3b - Project 400 schickel Aliquot Sequences 307 2011-10-28 01:29
Special project #3a - Project 300 schickel Aliquot Sequences 29 2011-08-12 17:45 down opyrt Prime Sierpinski Project 6 2010-04-20 10:51
pi(x) project ATH Miscellaneous Math 4 2006-08-30 17:59
new project junky NFSNET Discussion 18 2004-03-08 03:05

All times are UTC. The time now is 18:04.

Sun Jul 25 18:04:54 UTC 2021 up 2 days, 12:33, 0 users, load averages: 1.52, 1.79, 1.60

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.