mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Sierpinski/Riesel Base 5

Reply
 
Thread Tools
Old 2016-03-11, 01:00   #1
PawnProver44
 
PawnProver44's Avatar
 
"NOT A TROLL"
Mar 2016
California

197 Posts
Post 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?
PawnProver44 is offline   Reply With Quote
Old 2016-03-11, 03:11   #2
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

2·4,481 Posts
Default

We do both.
This is the time when I miss RDS.
LaurV is offline   Reply With Quote
Old 2016-03-11, 04:34   #3
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

22×32×53 Posts
Default

Quote:
Originally Posted by LaurV View Post
This is the time when I miss RDS.


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 2016-03-11 at 04:35
VBCurtis is offline   Reply With Quote
Old 2016-03-11, 04:42   #4
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

2·4,481 Posts
Default

Quote:
Originally Posted by VBCurtis View Post


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
Not only, but he made a mess in other threads too (srsieve) refusing to read help files after indicated so by many users, and asking silly questions like why his system can't find a file created by himself few minutes before (most probably typo in the name). He really channeled my inner RDS, I had the feeling that he is doing it on purpose, and only being very busy here at the office kept me from posting an angry reply there. I think we helped him enough, it is the time to help himself.
LaurV is offline   Reply With Quote
Old 2016-03-11, 06:08   #5
axn
 
axn's Avatar
 
Jun 2003

12B516 Posts
Default

Quote:
Originally Posted by PawnProver44 View Post
Base 3 is easier than base 5, so how come people are choosing to do Base 5 instead?
What makes you think base 3 is easier than base 5? AFAIK, there is not even a proper conjectured k value in base 3 (but I haven't looked into the matter in a while, so could be wrong).

Not having 3 available as a divisor really reduces the efficacy of would-be covering sets.

(If you didn't understand any of that, you have a lot of learning to do).
axn is offline   Reply With Quote
Old 2016-03-11, 06:26   #6
PawnProver44
 
PawnProver44's Avatar
 
"NOT A TROLL"
Mar 2016
California

197 Posts
Post

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 2016-03-11 at 06:27
PawnProver44 is offline   Reply With Quote
Old 2016-03-11, 06:56   #7
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

2·47·109 Posts
Default

Quote:
Originally Posted by axn View Post
What makes you think base 3 is easier than base 5? AFAIK, there is not even a proper conjectured k value in base 3 (but I haven't looked into the matter in a while, so could be wrong).

Not having 3 available as a divisor really reduces the efficacy of would-be covering sets.

(If you didn't understand any of that, you have a lot of learning to do).
Yes there is:
On the Riesel side it's k=63064644938
On the Sierpinski side it's k=125050976086
gd_barnes is offline   Reply With Quote
Old 2016-03-11, 07:01   #8
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

896210 Posts
Default

Well, wrong again
Which one is smaller, \(3^{63064644938}\), or \(5^{346802}\)?

(why those values?)


Last fiddled with by LaurV on 2016-03-11 at 07:03 Reason: I made a mess with those powers, forgetting the accolades
LaurV is offline   Reply With Quote
Old 2016-03-11, 07:04   #9
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

2×47×109 Posts
Default

Quote:
Originally Posted by PawnProver44 View Post
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.
PawnProver, quit being so stubborn and read people's previous posts instead of posting the same thing over and over. You've been directed where to go already and still don't seem to get the hint. See responses in the previous thread:
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...e3-reserve.htm
Sierpinski base 3: http://www.noprimeleftbehind.net/cru...e3-reserve.htm

The reason that base 5 was started before base 3 was because the conjectured k-value 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 2016-03-11 at 07:17
gd_barnes is offline   Reply With Quote
Old 2016-03-11, 07:20   #10
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

280616 Posts
Default

Quote:
Originally Posted by LaurV View Post
Well, wrong again
Which one is smaller, \(3^{63064644938}\), or \(5^{346802}\)?

(why those values?)
And wrong one more time.

It's 63064644938*3^n-1 and 346802*5^n-1. The conjectured k-value 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 n-value.

Wow, that's a lot of misinformation flying around here in just a few hours.

Last fiddled with by gd_barnes on 2016-03-11 at 07:24
gd_barnes is offline   Reply With Quote
Old 2016-03-11, 07:37   #11
axn
 
axn's Avatar
 
Jun 2003

4,789 Posts
Default

Quote:
Originally Posted by gd_barnes View Post
Yes there is:
On the Riesel side it's k=63064644938
On the Sierpinski side it's k=125050976086
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?
axn is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
GMP-ECM for base-2? CRGreathouse Factoring 1 2010-12-29 08:45
Base-6 speed for prime testing vs. base-2 jasong Conjectures 'R Us 36 2010-08-03 06:25
Base 6 masser Conjectures 'R Us 2 2008-06-27 04:29
Log to what base? edorajh Math 5 2003-12-17 16:31
base 3 ET_ Puzzles 1 2003-12-13 10:45

All times are UTC. The time now is 16:42.

Thu Dec 3 16:42:00 UTC 2020 up 12:53, 0 users, load averages: 2.28, 2.33, 2.31

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.