how high will CRUS go

TimSorbet · 2010-11-08, 19:06

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?

gd_barnes · 2010-11-08, 20:50

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.

2010-11-08, 19:06	#1
TimSorbet Account Deleted "Tim Sorbera" Aug 2006 San Antonio, TX USA 11×389 Posts	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 TimSorbet on 2010-11-08 at 19:08

2010-11-08, 20:50	#2
gd_barnes "Gary" May 2007 Overland Park, KS 2·3·7·281 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

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Sieving for CRUS	rebirther	Conjectures 'R Us	826	2023-01-25 15:49
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