20160311, 01:00  #1 
"NOT A TROLL"
Mar 2016
California
197 Posts 
Please Base 3
Nothing Big, this is just A quick request that someone should consider adding a base 3 project. Base 5 sounds stupid to me (when compared with base 3). Base 3 is easier than base 5, so how come people are choosing to do Base 5 instead?

20160311, 03:11  #2 
Romulan Interpreter
"name field"
Jun 2011
Thailand
24051_{8} Posts 
We do both.
This is the time when I miss RDS. 
20160311, 04:34  #3 
"Curtis"
Feb 2005
Riverside, CA
3^{3}·11·19 Posts 
OP You ought to consider perusing all the subforums on this site. You might find what you're looking for. And why would you start a new thread for this when you not only already requested this in another thread a few days ago, *AND* were directed to the link to find the project you requested? Argh Last fiddled with by VBCurtis on 20160311 at 04:35 
20160311, 04:42  #4  
Romulan Interpreter
"name field"
Jun 2011
Thailand
3·23·149 Posts 
Quote:


20160311, 06:08  #5  
Jun 2003
2×2,719 Posts 
Quote:
Not having 3 available as a divisor really reduces the efficacy of wouldbe covering sets. (If you didn't understand any of that, you have a lot of learning to do). 

20160311, 06:26  #6 
"NOT A TROLL"
Mar 2016
California
197 Posts 
Base 3 is simply smaller. For example 3^262399 is 125197 digits, whereas 5^262399 is 183410 is digits. That saves 58213 digits and is MUCH easier to compute. Also, factors of 3 are used WAY more often than factors of 5 in everyday life. Just simply learn Base 12.
Last fiddled with by PawnProver44 on 20160311 at 06:27 
20160311, 06:56  #7  
"Gary"
May 2007
Overland Park, KS
2×5,927 Posts 
Quote:
On the Riesel side it's k=63064644938 On the Sierpinski side it's k=125050976086 

20160311, 07:01  #8 
Romulan Interpreter
"name field"
Jun 2011
Thailand
2829_{16} Posts 
Last fiddled with by LaurV on 20160311 at 07:03 Reason: I made a mess with those powers, forgetting the accolades 
20160311, 07:04  #9  
"Gary"
May 2007
Overland Park, KS
2×5,927 Posts 
Quote:
http://mersenneforum.org/showpost.ph...1&postcount=16 http://mersenneforum.org/showpost.ph...3&postcount=19 See the Conjectures 'R Us project at http://mersenneforum.org/forumdisplay.php?f=81. For a status of all bases see: Riesel: http://www.noprimeleftbehind.net/cru...onjectures.htm Sierpinski: http://www.noprimeleftbehind.net/cru...onjectures.htm For statuses of base 3 see: Riesel base 3: http://www.noprimeleftbehind.net/cru...e3reserve.htm Sierpinski base 3: http://www.noprimeleftbehind.net/cru...e3reserve.htm The reason that base 5 was started before base 3 was because the conjectured kvalue for base 5 is much lower than base 3. Base 3 is a tremendous amount of work. See my last post. Just because it is easier to find primes for base 3 than base 5 does not mean that base 3 is less effort. On the contrary it is far more effort than base 5 because so many more k's must be searched. For the past 8 years, Conjectures 'R Us (CRUS) has been working on all bases <= 1030 that are not being worked on by other projects. A large portion of Riesel base 3 has been tested to n=25K. For Sierpinski base 3 only k<=1G (k<=10^9) has been tested. Do not expect any further help from anyone on this unless it is help beginning your search in the CRUS subforum. Last fiddled with by gd_barnes on 20160311 at 07:17 

20160311, 07:20  #10  
"Gary"
May 2007
Overland Park, KS
2E4E_{16} Posts 
Quote:
It's 63064644938*3^n1 and 346802*5^n1. The conjectured kvalue has nothing to do with the exponent. Base 3 is more effort because there are more k's to search not because the exponent is higher. The exponent is the nvalue. Wow, that's a lot of misinformation flying around here in just a few hours. Last fiddled with by gd_barnes on 20160311 at 07:24 

20160311, 07:37  #11 
Jun 2003
12476_{8} Posts 
Have all the k's below them been ruled out as not having a covering set? IOW, do we have actual reason to conjecture that these are in fact the smallest S/R Base 3 k's?

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
GMPECM for base2?  CRGreathouse  Factoring  1  20101229 08:45 
Base6 speed for prime testing vs. base2  jasong  Conjectures 'R Us  36  20100803 06:25 
Base 6  masser  Conjectures 'R Us  2  20080627 04:29 
Log to what base?  edorajh  Math  5  20031217 16:31 
base 3  ET_  Puzzles  1  20031213 10:45 