Go Back > Prime Search Projects > Conjectures 'R Us

Thread Tools
Old 2010-11-08, 19:06   #1
Account Deleted
Mini-Geek's Avatar
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

3·1,423 Posts
Default how high will CRUS go

This is a project that has a specific, though difficult, goal: prove the Riesel and Sierpinski conjecture for every base with b<=1030. How big can we expect the biggest prime needed to finish CRUS to be? How long can we expect that to take? What base is most likely to be the hardest to prove? What base is most likely to be proven at the highest n?

Last fiddled with by Mini-Geek on 2010-11-08 at 19:08
Mini-Geek is offline   Reply With Quote
Old 2010-11-08, 20:50   #2
gd_barnes's Avatar
May 2007
Kansas; USA

1055510 Posts

Very provocative questions.

I think that base 280 on both sides should be the toughest. I have no idea how high the final prime will need to be. My guess is that it will be something much greater than a googol (10^100) digits long.

Last fiddled with by gd_barnes on 2010-11-08 at 23:35
gd_barnes is online now   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Sieving for CRUS rebirther Conjectures 'R Us 657 2021-09-01 18:01
Some CRUS stats vmod Conjectures 'R Us 213 2014-02-28 21:23
What are your CRUS plans? rogue Conjectures 'R Us 35 2013-11-09 09:03
CRUS-like sieving challenge CRGreathouse Puzzles 24 2011-10-28 18:30
LLRnet servers for CRUS gd_barnes Conjectures 'R Us 39 2008-07-15 10:26

All times are UTC. The time now is 00:19.

Fri Dec 3 00:19:20 UTC 2021 up 132 days, 18:48, 1 user, load averages: 1.76, 1.54, 1.36

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.