Unless George/Scott set some legal mumbo jumbo that ties into use of the
program/source/services, they're simply not "entitled" to any prize money.
I'm forced to agree with Aaron, aparently at gunpoint :-) (and I said this a
while ago, BTW). Even if they (George and Scott) did this, then there
At 12:44 AM 7/25/99 -0600, Aaron Blosser wrote:
Neither GIMPS nor Primenet have *any* legal claim for any prize for
any discovery made using Prime95/NTPrime/mprime, or any code modified
and compiled that was based on George's code. Let's face it, there is
nothing stipulated in the use of any of
[Not in reply to any specific message - no names, no pack drill]
Hey, guys, surely we don't want a war over this?
Here are a few relevant points:
1. GIMPS/PrimeNet as a whole constitutes a "team" in so far as we
(usually) co-operate loosely with each other in order not to waste
time and
Hi all,
You may have noticed that the web pages at mersenne.org haven't been
updated recently. The reason is I've "lost" FTP access to update the pages.
So, after several years at lushen.com, I'll be moving the web pages to
entropia.com in the coming weeks. Be prepared for a few
Hello, everyone. Wow, there was a lot in the last digest that I thought
needed commenting on. This prize thread is _almost_ getting as bad, in my
opinion, as the other, recent, evil thread which I shall not name. I am, of
course, replying to many different people in this message.
P.S. Are
Ken Kriesel writes:
I think Duncan Booth's name at least ought to be considered when
discussing the $ split. He wrote the first version of primenet
server and client; Scott Kurowski continued from the starting point
that Duncan provided. I suspect that Scott has considerably more
Lucas Wiman writes:
I'm forced to agree with Aaron, aparently at gunpoint :-) (and I
said this a while ago, BTW). Even if they (George and Scott) did
this, then there would still be MacLucasUNIX, or everything else in
the mers package, as well as Ernst's program, and good ol'
At 03:22 PM 7/25/99 -0400, you wrote:
This is my fear. Right now, GIMPS is the only major concerted effort to find
Mersenne Primes, and we ought to keep it that way. This has led to orderly
searching, and not a mad free-for-all. The prize money should (and must!) go
entirely to the discoverer,
At 04:40 PM 7/25/99 -0400, Jeff Woods wrote:
While I agree with this, if the effort does NOT fragment and jump ahead
to potential 10MM-digits, someone else is likely to find and claim that
$100K with a Proth prime, since checking those will take far less time than
a Mersenne test of the
Is that true? I thought that a LL test of a Mersenne was faster.
Everything I've ever heard says that LL tests are faster than Proth, and in
fact the quickest test for primality versus other types of numbers. Hm.
S.T.L.
_
At present we find approx. 1% of the LL
test results submitted are incorrect.
That figure seems a tad high. After double-checking, there would be a 0.01%
chance that BOTH tests had failed, which seems very high to me.
Well, the likelyhood that a failure occurs may be 1%, but the likelyhood
that
Proth's Test for n = k*2^m+1 says that there exists a such that
a^(n-1)/2 + 1 is divisible by n.
The other factor in evaluating this is that, in Proth's Test, a has
got to be an odd prime - if you pick the wrong prime, you're wasting
time, though fortunately this can usually be detected very
At 07:13 PM 7/25/99 -0400, Chris Nash wrote:
That bit is virtually free of charge. Any quadratic non-residue will do just
fine.
But you don't easily know if a number is a QNR, do you?
+--+
| Jud "program first and think later" McCranie |
That bit is virtually free of charge. Any quadratic non-residue will do
just
fine.
But you don't easily know if a number is a QNR, do you?
Suppose the number you're testing is N. If we assume N is prime, then
quadratic reciprocity could be used to determine whether your base a is a
QNR. So
14 matches
Mail list logo
