- that the message
handling routines in the client do as much sanity checking as possible, and
abort the program /before/ returning if anything untoward is found.
Regards
Daran Gill
_
Unsubscribe list info -- http://www.scruz.net/~luke
from your prime95 directory into your mprime directory, while copying in
the reverse direction when you shutdown.
Nathan
Daran
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ
th Primenet
accounts solely for a significant proportion of their connection time is
vanishingly small.
mikus
Daran G.
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.ta
-Original Message-
From: Brian J. Beesley [EMAIL PROTECTED]
To: Daran [EMAIL PROTECTED]
Date: 11 March 2001 22:48
Subject: Re: Mersenne: Security of prime95 + electricity costs.
You are of course correct. But to make this work requires a lot of
knowledge about how the application
-Original Message-
From: Martijn Kruithof [EMAIL PROTECTED]
To: Daran [EMAIL PROTECTED]; [EMAIL PROTECTED] [EMAIL PROTECTED]
Date: 12 March 2001 00:45
Subject: RE: Mersenne: Security of prime95 + electricity costs.
I have verified the possibility of a buffer overflow exploit
-Original Message-
From: Brian J. Beesley [EMAIL PROTECTED]
To: Daran [EMAIL PROTECTED]
Date: 12 March 2001 21:08
Subject: Re: Mersenne: Security of prime95
On 12 Mar 2001, at 6:03, Daran wrote:
Now I'm not saying it's sensible to ignore risk, or not to take
reasonable measures
is? By 'proof', I mean to exclude the
possibility that someone randomly generates a couple of large probable primes,
multiplies them together, then forgets them.
-Ernst
Daran G.
_
Unsubscribe list info -- http
schedule triple-checks by essentially telling the server
to forget about the double-check result it already has.
I assume that means that it forgets that a result has been returned. The
/value/ that was returned should not be forgotten.
Hope that helps,
George
Daran G
that's basically a good idea, it's important to be honest with
participants. A patch would not be enough. People need to be informed about
departures from documented practice.
Regards
Brian Beesley
Daran G.
_
Unsubscribe
afforded to list members. I put 'elitism' into
quotes because I don't agree that it is elitism at all.
Nathan Russell
Daran G.
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http
exponents are only
awarded to fast machines with a track record of reliability?
Alternatively, since nobody seems to find it objectionable, why not take these
exponents off the primmest server, and offer them to list subscribers only?
Nathan
Daran G
at the number theory, but presumably these are more likely to be
prime for no other reason than because they are relatively small, and the
density of Mersenne primes decreases with size.
| Jud McCranie |
Daran G
available to the project, and not left to the vagaries of
random allocation?
Steve Harris
Daran G.
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ
.
Regards
Daran G.
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
on...
That's the version I'm running. Has there been an update since last June that
I don't know about?
Nathan
Daran G.
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http
-Original Message-
From: Gareth Randall [EMAIL PROTECTED]
To: [EMAIL PROTECTED] [EMAIL PROTECTED]
Date: 15 May 2001 23:36
Subject: Re: Mersenne: GIMPS accelerator?
Daran,
This is an interesting piece of lateral thinking that deserves to go further
than I think it actually does.
Thank
-checks
or factorisations.
Regards
Brian Beesley
Daran G.
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
result, and would have had to wait five months to turn in the
next if I hadn't upgraded. The new machine runs fifteen to twenty times as
fast, so I should double that in a couple of months or so.
Cheers... Russ
Daran G
What is the probability of a successful trial factorisation in the range of
exponants currently being given out (16-17M)?
Are the estimates given by the program for p-1 factorisation accurate?
Regards
Daran G
, or to do so with a good chance of success, could be given pretested
exponants for first-time/DC LLs
Regards
Daran G.
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http
-Original Message-
From: CARLETON GARRISON [EMAIL PROTECTED]
To: Daran [EMAIL PROTECTED]; [EMAIL PROTECTED] [EMAIL PROTECTED]
Date: 24 July 2001 00:18
Subject: Re: Mersenne: P-1
Daran,
Again I'm not the most qualified person to reply but...
The name of the game is validate
, and it was still happily hacking
through a DC. I won't be visiting her for some time, and I can't ask her to
do any more than trivial admin. Would it be sufficient just to tell her how
to set it to automatic communication? Would this upset the primenet server?
Regards
Daran G
-Original Message-
From: George Woltman [EMAIL PROTECTED]
To: Daran [EMAIL PROTECTED]; [EMAIL PROTECTED] [EMAIL PROTECTED]
Date: 24 July 2001 21:17
Subject: Re: Mersenne: P-1
I'll see if I can work out a solution with Scott. A minimum solution would
have
the server return whether
than 170...727 is not a factor of P.
Regards,
Leo de Velez
Daran G.
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
it with itself
Oh, you are a tease. :-)
What is it that you do?
Regards,
George
Daran
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
. It's not even 0 mod
3
However http://www.utm.edu/research/primes/mersenne.shtml#test does state
the P must be odd. So I guess the mersenne.org page is wrong.
Nathan
Daran
_
Unsubscribe list info -- http://www.scruz.net
to incorporate
this additional information.
Alex
Daran G.
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
min. factor size
M751 - 81.0003% probability - 526-bit max. factor size
Ditto 807 bits.
M751 - 30.1716% probability - highly composite factors
Is M751 now the smallest unfactorised composite Mersenne? What is the
smallest Mersenne not completely factorised?
Regards
Daran G
0099f124 10001327 0099f020 005c 00640e4c
0099f55c 0002 00640e4c 00640e4c 7fc12c78 005c 000b
Regards
Daran
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ
!
Does this mean that we're not doing enough double-checking?
Regards
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
as effectively as I can with 512MB RAM, if they can do
it at all. Therefore I am doing work which might not otherwise get done.
[...]
As an old punchline goes: If you don't, someone else will! Ahem.
Or not.
Richard B. Woods
Daran G
.
Regards
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
))
prime), it's generally expected to be composite.
Nathan
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
to make it worth while returning to verified composite Mersennes.
Richard Woods
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
of interest, why should prior discoverers be so privileged?
[...]
Irritated
Yes, I rather feel the same. It's like enjoying the build-up to Christmas
only to find that someone's open your present five days ahead of time.
Brian Beesley
Daran G
* chance_of_trial_factoring. Then P-1 factorise.
Then complete trial factorisation according to the above formula.
-- George
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ
- Original Message -
From: [EMAIL PROTECTED]
To: Daran [EMAIL PROTECTED]
Cc: [EMAIL PROTECTED]
Sent: Monday, December 03, 2001 11:22 PM
Subject: Re: Mersenne: Re: Factoring benefit/cost ratio
On 3 Dec 2001, at 20:45, Daran wrote:
Shouldn't that be 1.015 for double-checking
probably not that
far behind GIMPS in terms of total computing done. How far will depend upon
how good they are at mobilising support.
[...]
In reply to a statement of mine about the extra benefit of finding a
specific factor,
Daran G. wrote:
I can see no way of objectively quantifying
if factors are given an
intrinsic value of their own.
Of course, the real scarce resource is not computer cycles, nor even ideas
for improvement, but in programming effort to implement. Calculating that
particular trade-off I leave to others.
-- George
Daran G
automatically - i.e. will new
exponents be automatically sent if a manual update is done?
Thanks,
Keith
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http
, the uncountable infinity of
non-rational real numbers, complex numbers, quaternians...
The rest of our efforts have been trivial in comparison. :-)
Nathan
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne
start doing our bit to promote this. I'm
itching to get this into into my email/newsgroup sig, but I don't want to
preempt the official release by as much as one second.
Also what's the prefered URL?
Congratulations to all,
George
Daran G
... of the GIMPS website http://www.mersenne.org/ a list of other
distributed computing projects? By all means link to and support these
projects, but wouldn't prime.htm be a more sensible starting point?
Regards
Daran G
The math page http://www.mersenne.org/math.htm explains how to do a stage 1
P-1 test with given bound B1, but it omits the explanation of the
enhansement that uses B2 in stage 2. Anyone care to explain
how this is done?
Cheers
Daran G
- Original Message -
From: Alexander Kruppa [EMAIL PROTECTED]
To: Daran [EMAIL PROTECTED]; [EMAIL PROTECTED]
Sent: Monday, December 10, 2001 12:16 AM
Subject: Re: Mersenne: P-1 Stage 2
P-1 stage 1 computes x = a^E (mod N), where E is the product of all
primes and prime powers = B1
prime search is moving in that direction. Each day, its
network of computers does work that would take a single 90MHz Pentium
computer 200 years to accomplish...
200 X 365 = 73000 p90 days/day
So what are the other 137,000 faster than P90 machines doing?
Regards
Daran
computing project. An idling computer is like a
running tap.
Cheers... Russ
Daran
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
of machines includes many that are not really
active.
Bruce
Daran
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
- Original Message -
From: Alexander Kruppa [EMAIL PROTECTED]
To: Daran [EMAIL PROTECTED]
Cc: [EMAIL PROTECTED]
Sent: Saturday, December 15, 2001 2:05 AM
Subject: Re: [Fwd: Mersenne: P-1 Stage 2]
However, there's another generalisation that occurs to me that would be
quite cheap
?
Regards
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
.
Any suggestions?
If you've got less than 512MB on your linux box, email the exponant(s) to
me, (after you've TFed it) and I'll P-1 it for you. I can do a 6-7M P-1 in
about 3 hours, so I'd guess it'd take a couple of days.
TIA, Gerry
Daran G
finding M#39?
Just my few words
happy hunting
tsc
Daran
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
. If you work in the same order
as the poacher, work on lots of exponents will be replicated. If you
work in the opposite order, only one exponent will be accidentally
triple-checked.
A solution, then, is not to do small exponants at all.
Regards
Brian Beesley
Daran G
by someone else in some uncertain future? Currently I'm
finishing my first exponent (that's M7505207 double-check)...
Don't disclose your exponants to a list read by Aaron Blosser. :-)
M,
--
Maciej Hrynczyszyn banshee*uoo.univ.szczecin.pl _ __ __ _ __| | __ _
Daran G
it permanently.
I now have 90 days of DC work queued, which I have to do, or lose the work
I've done.
Does anyone know about this?
Regards
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
-- it stores the last
two names until a valid doublecheck proves the exponent composite.
Better would be to store every name until a valid doublecheck proves the
exponant composite. The extra storage would be negligable.
Bruce Leenstra mailto:[EMAIL PROTECTED]
Daran G
there, then.
Personally I can think of at least two characteristics of kookdom exhibited
by you - a total disregard for the feelings of others, and making absurd
stalking allegations against them.
Regards
Daran G.
_
Unsubscribe list info
WITH EXPONENT-POACHERS as well as all WEAKLING MORAL RELATIVISTS,
Death to the extremists!
/eli
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman
- Original Message -
From: Brian J. Beesley [EMAIL PROTECTED]
To: Daran [EMAIL PROTECTED]; [EMAIL PROTECTED]
Sent: Sunday, June 09, 2002 2:18 PM
Subject: Re: Mersenne: P-1 Puzzle
6972001 and 7076669 are starred although the fact bits column seems to
indicate that both trial factoring
- Original Message -
From: Daran [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Sent: Monday, June 10, 2002 6:54 AM
Subject: Re: Mersenne: P-1 Puzzle
This appears to have happened to me at least once. I'll spend some time
later today cross-referencing my WTD file against pminus1.txt to see
- Original Message -
From: Brian J. Beesley [EMAIL PROTECTED]
To: Daran [EMAIL PROTECTED]; [EMAIL PROTECTED]; Anurag Garg
[EMAIL PROTECTED]
Sent: Tuesday, June 11, 2002 8:23 PM
Subject: Re: Mersenne: P-1 Puzzle
On Tuesday 11 June 2002 06:13, Daran wrote:
[... snip ... interesting
I read a while back that exponents up to 8M had been made available for DC
assignments. Currently the server is up to 797. Have any more been
made available? Is this information available anywhere on the webpages?
Regard
Daran
) is dated April this year.
Regards
Daran
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Prime95 version 22.3.1
P-1 factoring with 459MB available memory, the program chose the following
limits for these two exponants.
7786567B1=4, B2=64
7714127B1=4, B2=65
Why did the smaller exponant get the higher B2 limit?
Regards
Daran G
). The only trade-off
is between the cost of the P-1 vs the expected cost of the LL computation.
Regards
Brian Beesley
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http
- Original Message -
From: Christian Goetz [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Sent: Saturday, July 20, 2002 8:39 PM
Subject: Re: Mersenne: Roundoff errors
Am Samstag, 20. Juli 2002 19:01 schrieb Daran:
The temp is normal, it shouldn't be over 65 degrees. Try to get a new fan
- Original Message -
From: George Woltman [EMAIL PROTECTED]
To: [EMAIL PROTECTED]; [EMAIL PROTECTED]
Cc: [EMAIL PROTECTED]
Sent: Wednesday, July 24, 2002 3:01 AM
Subject: Mersenne: Re: Roundoff errors
Daran mentioned that he was only doing P-1 factoring,
leaving the LL test for others
,
Ian
Daran
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
be releasing it back to the server within the
next few days, unless I hear that I shouldn't.
Regards
Daran
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com
- Original Message -
From: George Woltman [EMAIL PROTECTED]
To: Daran [EMAIL PROTECTED]; [EMAIL PROTECTED]
Sent: Monday, August 19, 2002 3:28 PM
Subject: Re: Mersenne: Status
The first test of this number had 5 roundoff 0.40 errors. Since the
result is highly suspect, it was re
will stand for exaflops in your quantum computer, and we'll
be working with FFT's in the gigabyte size range. ;-)
When we get a GigaQbit QC, we won't be bothering with FFTs. We'll just test
every exponent simultaneously by trial division.
Regards
Daran
]
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
bandwidth which is the limiting factor. The 1%
improvement probably comes again from synchronous operation.
Regards
Brian Beesley
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne
from 9-11 to 9-5, is v.22.8 that much
more efficient than 21.4?
This is on my Athalon processor. I have a pentiumIII I'm
going to upgrade also, will it speed it up too?
You mean Pentium IV, surely? A Pentium III is a downgrade from an Athlon.
Regards
Daran G
I'm taking the liberty of replying to his on-list, since other people here
might have some input.
- Original Message (Off-list)
From: Anurag Garg [EMAIL PROTECTED]
To: Daran [EMAIL PROTECTED]
Sent: Tuesday, September 10, 2002 11:11 PM
Subject: Re: Cherub faced individuals with shoes
range (though found factors are checked by the server itself).
And I would be disappointed if I learned that an LL I did could have
been solved far earlier - and using less effort.
One way to avoid this disappointment personally would be to focus solely
upon TF or
P-1.
br tsc
Daran G
past a large range of possible factors, would be made a great
deal
more difficult.
Easily cracked. Why not just encrypt it?
Regards
Brian Beesley
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne
TFed.
Jacek Kolonko
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Could this feature of forthcoming Intel processors be used to do trial
factorisation without adversely impacting upon a simultaneous LL? Could
this be easily implemented?
Regards
Daran G.
_
Unsubscribe list info -- http
- Original Message -
From: Torben Schlüntz [EMAIL PROTECTED]
To: Daran [EMAIL PROTECTED]; [EMAIL PROTECTED]
Sent: Saturday, September 21, 2002 11:17 PM
Subject: SV: Mersenne: TF - an easy way to cheat
But my name is Torben...
My apologies.
With an unusual spelling to my own name, I
- Original Message -
From: Michael Vang [EMAIL PROTECTED]
To: Daran [EMAIL PROTECTED]; [EMAIL PROTECTED]
Sent: Sunday, September 22, 2002 12:19 AM
Subject: Re: Mersenne: Hyper-threading
Look towards the end of this thread for benchmarks with LL and factoring
on
one processor via
found
earlier during TF. However given that some factors found have been 130
bits, then the possibility is there.
I was wondering if returned factors are checked for primality.
Regards
Daran G.
_
Unsubscribe list info
- Original Message -
From: Alexander Kruppa [EMAIL PROTECTED]
To: Daran [EMAIL PROTECTED]
Cc: [EMAIL PROTECTED]
Sent: Wednesday, September 25, 2002 1:03 AM
Subject: Re: Mersenne: P-1 and non k-smooth factors
This is the Brent-Suyama extension, aka Suyama's powers. In short, if
you
.
What do you have in mind, a volunteer marketing effort?
'Volunteer' goes without saying. Certainly we need a marketing effort.
Does anyone have any ideas?
Eric
Daran
_
Unsubscribe list info -- http://www.ndatech.com
doesn't 'owe' us a mention.
Eric Weddington
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Beesley
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
- Original Message -
From: Steve Harris [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Sent: Thursday, October 24, 2002 8:49 PM
Subject: Re: Mersenne: On v18 factoring
Daran - you ask why highest and not lowest? The discussion started
regarding old machines running v18 which are no longer
know
that this is not trivial, but it remains feasible.
Regards
Brian Beesley
Daran
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
,
That's what beta testers are for.
George
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
- Original Message -
From: Daran [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Sent: Tuesday, November 05, 2002 6:51 PM
Subject: Re: Mersenne: Bug in version 22.10
- Original Message -
From: George Woltman [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Sent: Tuesday, November 05, 2002 5:19
to
get a (possibly reduced) chance of finding a factor in stage 2
Regards
Brian Beesley
Daran
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ
, then 21-1 was improperly included. If 21+3
is prime, then 21-3 was included.
How could this lead to factors being missed?
Regards
Daran
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
for any P-1 you do.
Regards
Daran G.
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
user
could get an allowance, proportionate to the number of TF assignments
returned, that would be deemed to be 'honest' errors, and not penalised.
P-1 (which I do almost exclusively) seems to be woefully ill-rewarded.
tsc
Daran G
- Original Message -
From: Alexander Kruppa [EMAIL PROTECTED]
To: Daran [EMAIL PROTECTED]
Cc: [EMAIL PROTECTED]
Sent: Wednesday, September 25, 2002 12:03 AM
Subject: Re: Mersenne: P-1 and non k-smooth factors
This is the Brent-Suyama extension, aka Suyama's powers. In short, if
you
will keep us going into at least M35.999.999 for
the save files. What will happen when Z is used out? I very well know we
have a couple of years to rethink but the day is going to come...
There's no need to restrict filenames to 8 characters with modern OSs
Regards
Daran G
. Most things were functional
then but the status updates had last run 8am. Now we've got an
unresponsive
server. Anyone heard anything?
Is it my imagination, or has the server gotten far less reliable in recent
months?
--
[EMAIL PROTECTED] - HMC UNIX Systems Manager
Daran G
- Original Message -
From: George Woltman [EMAIL PROTECTED]
To: Daran [EMAIL PROTECTED]; [EMAIL PROTECTED]
Sent: Thursday, November 28, 2002 2:18 AM
Subject: Re: Mersenne: P-1 and non k-smooth factors
At 06:05 PM 11/27/2002 +, Daran wrote:
if (D = 180) E = 2
- Original Message -
From: Brian J. Beesley [EMAIL PROTECTED]
To: Daran [EMAIL PROTECTED]; [EMAIL PROTECTED]
Sent: Wednesday, December 04, 2002 2:55 PM
Subject: Re: Mersenne: P-1 and non k-smooth factors
Let's see if I get this right.
Overwhelmingly, the factors produced by P-1
- Original Message -
From: Alexander Kruppa [EMAIL PROTECTED]
To: George Woltman [EMAIL PROTECTED]
Cc: Daran [EMAIL PROTECTED]; [EMAIL PROTECTED]
Sent: Thursday, December 05, 2002 12:18 PM
Subject: Re: Mersenne: P-1 and non k-smooth factors
George Woltman wrote:
At 10:31 PM 12/3/2002
1 - 100 of 116 matches
Mail list logo
