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

17·251 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