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?

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. 
All times are UTC. The time now is 13:58. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2020, Jelsoft Enterprises Ltd.