Base-6 speed for prime testing vs. base-2 - Page 3

firejuggler · 2010-07-25, 21:12

bridge? the only other use for them is to burn

MooMoo2 · 2010-08-01, 02:05

Quote:

Originally Posted by jasong

Edit: There's still the matter of that twin prime exponent I advised everyone to use on here. Maybe now someone would be willing to start a project?

Ah. A trip down memory lane:

http://www.mersenneforum.org/showthread.php?t=10320

mdettweiler · 2010-08-01, 03:18

Quote:

Originally Posted by MooMoo2

Ah. A trip down memory lane:

http://www.mersenneforum.org/showthread.php?t=10320

Hope you don't mind my asking, but would you happen to be the same guy as MooooMoo (a.k.a. Michael Kwok, if I remember correctly), the former administrator of TPS who hasn't been on the forum since August 2009? Could be just a similarity in names but I figured I'd ask just in case.

axn · 2010-08-01, 04:25

Quote:

Originally Posted by Tumo

Their reasoning was disclosing the number and the required cpu time would show what the equipment could do but more so the characteristics of a few numbers we found in that range.

Is there a reason why you can't just disclose the number (without any other information)?

CRGreathouse · 2010-08-01, 04:25

Quote:

Originally Posted by MooMoo2

Ah. A trip down memory lane:

http://www.mersenneforum.org/showthread.php?t=10320

Nice. I ran the numbers on that; it looks like it would take a lot of work to statistically disprove this to reasonable confidence (in this case, to show that the 95% confidence Agresti-Coull interval does not contain 20/100e6): up to 30 million if you discover no primes, 120 million if you discover roughly the expected number of primes, and 160 million if you're slightly 'unlucky' in discovering many primes.

retina · 2010-08-01, 04:54

Quote:

Originally Posted by axn

Is there a reason why you can't just disclose the number (without any other information)?

Yes. Because it is not true. What other reason could there be to claim a discovery but then not reveal any proof?

And hey, if by chance I am wrong about that then, Tumo, prove me wrong.
Extraordinary claims require ...

Hey cool, I just found a 100M digit prime number. Sorry, I can't say what it is because my boss said "no". Oh well, too bad, you will all just have to believe me.

CRGreathouse · 2010-08-01, 04:59

Quote:

Originally Posted by retina

Hey cool, I just found a 100M digit prime number. Sorry, I can't say what it is because my boss said "no". Oh well, too bad, you will all just have to believe me.

I can top that, I have a billion-digit prime that I decline to share.

gd_barnes · 2010-08-02, 19:26

Can someone give me a good reason not to delete this thread?

Cranks with ridiculous claims make the project look bad. (Note: I'm not referring to what are clearly jokes by the regular forum math guys. Only to the OP and what appears to be a cohart.)

Maybe I'm over-reacting. I could just lock it, I suppose.

Max and Ian; any thoughts?

kar_bon · 2010-08-02, 19:32

Quote:

Originally Posted by gd_barnes

Can someone give me a good reason not to delete this thread?

Cranks with ridiculous claims make the project look bad. (Note: I'm not referring to what are clearly jokes by the regular forum math guys. Only to the OP and what appears to be a cohart.)

Maybe I'm over-reacting. I could just lock it, I suppose.

Max and Ian; any thoughts?

Make an own copy of this page (*.mht) and delete!

There'll be no proof of such great new prime-finding procedure nor any 10M-digit prime!

mdettweiler · 2010-08-02, 19:44

Quote:

Originally Posted by gd_barnes

Can someone give me a good reason not to delete this thread?

Cranks with ridiculous claims make the project look bad. (Note: I'm not referring to what are clearly jokes by the regular forum math guys. Only to the OP and what appears to be a cohart.)

Maybe I'm over-reacting. I could just lock it, I suppose.

Max and Ian; any thoughts?

I'd suggest just leaving it as it is, believe it or not. I'm not quite sure I agree that it makes the project look bad; remember that it originally started with a perfectly normal question of which is faster, base 6 or base 2. Even though some of the claims made farther down the thread are rather glaringly unqualified, it's not like the whole subforum is swarming with crank threads; a few crazy claims here and there isn't going to turn somebody away from the project.

As this forum is meant for open discussion of the CRUS project and matters pertaining to it, I would usually hesitate to use the "Lock" function on any thread of at least tangential relevance as long as it doesn't turn into an enormous, pointless flamewar (which this one didn't). Deleting such a thread, an even more extreme measure, would be unwarranted, IMHO.

Tumo · 2010-08-02, 22:00

May I request the thread be left open for a bit to generate some results?

I've been contacted by some folks who would like to walk through the process again with me, without the rules of the company and (for those of you who must know...) US Gov't rules. Because my NDA is a lifetime thing, I cannot side-step it, but have found a few K candidates which show good promise.

They are currently running on my home 'mini-HPC' cluster. Not as good as the lab or the big machine, but will suffice for this effort.

In the spirit of the thread, I've made some changes to the K to be as base-2 equivalent as possible so a proper base-6 vs base-2 comparison can be made.

Thanks.

2010-07-25, 21:12	#23
firejuggler Apr 2010 Over the rainbow 5053₈ Posts	bridge? the only other use for them is to burn Last fiddled with by firejuggler on 2010-07-25 at 21:13

2010-08-02, 19:26	#30
gd_barnes May 2007 Kansas; USA 101·103 Posts	Can someone give me a good reason not to delete this thread? Cranks with ridiculous claims make the project look bad. (Note: I'm not referring to what are clearly jokes by the regular forum math guys. Only to the OP and what appears to be a cohart.) Maybe I'm over-reacting. I could just lock it, I suppose. Max and Ian; any thoughts? Last fiddled with by gd_barnes on 2010-08-02 at 19:28

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Bases 2 & 4 reservations/statuses/primes	Jean Penné	Conjectures 'R Us	466	2021-07-25 04:05
Base 13 prime found	Siemelink	Conjectures 'R Us	0	2009-10-05 18:27
Riesel base 3 new testing idea	gd_barnes	Conjectures 'R Us	10	2008-12-20 00:19
mini-drive for high-n testing on Sierp base 4	gd_barnes	Conjectures 'R Us	43	2008-07-16 10:12
Speed of P-1 testing vs. Trial Factoring testing	eepiccolo	Math	6	2006-03-28 20:53

2010-08-02, 22:00	#33
Tumo Jan 2005 19 Posts	May I request the thread be left open for a bit to generate some results? I've been contacted by some folks who would like to walk through the process again with me, without the rules of the company and (for those of you who must know...) US Gov't rules. Because my NDA is a lifetime thing, I cannot side-step it, but have found a few K candidates which show good promise. They are currently running on my home 'mini-HPC' cluster. Not as good as the lab or the big machine, but will suffice for this effort. In the spirit of the thread, I've made some changes to the K to be as base-2 equivalent as possible so a proper base-6 vs base-2 comparison can be made. Thanks.