On 22 Jan 00, at 15:44, St. Dee wrote:
This brings up something I've been wondering about. I have a dual Celeron
setup running 2 instances of mprime under Linux. With both processors
crunching on LL tests, I get iteration times for each processor of around
.263 for exponents around 899
On 22 Jan 00, at 11:35, Gerry Snyder wrote:
But finding a factor (or another factor) of a Mersenne number would seem
more real.
Is there any significant probability that two 500 MHz Celerons and one 333
MHz Celeron could accomplish such a feat in a couple of years?
Depends where you look
LiDIA is a free package for long number arithmetic.
It includes a demo-program for factoring numbers with trial factoring, ECM
and MPQS successive.
See here: http://www.informatik.tu-darmstadt.de/TI/LiDIA/Welcome.html
regards
Martin
-Ursprüngliche Nachricht-
Von: Foghorn Leghorn [EMAIL
Dear List-reader,
I've been running Prime95 on my PII-400 at work, since December, and
I'm
currently on my second LL test !
And I've also been running it on my Celeron366 Laptop at home (When my wife
isn't playing Settlers 3). I decided to make the Laptop do Factoring, and
From a quick browse through the top 101-500 producer list (it's the one
I'm in:) it looks like the odds say you can expect 10-15 factors per P90
year spent on factoring.
Based on my own stats, I've got 13.959 P90 years spent factoring, with 177
factors found. That's 12-13 per P90 year, so
Hi,
At 02:28 PM 1/23/00 -, Alex Phillips wrote:
I've factored five numbers, all in the 1165-1166 range, as
allocated by Primenet, without finding a factor.
So my question is, What are the odds on finding a factor ?
Since these exponents are already factored to 2^52 and you
If I pick a huge number n at random, how much smaller than n, on average, is
its largest prime factor?
phma
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ --
At 03:48 PM 1/23/00 -0500, Pierre Abbat wrote:
If I pick a huge number n at random, how much smaller than n, on average, is
its largest prime factor?
On the average, the largest prime factor of n is n^0.6065, and the second
largest is n^0.2117. Reference: Knuth, the Art of Computer
On Sat, 22 Jan 2000, George Woltman wrote:
Finding new factors of small Mersennes, so called Cunningham factors, is
getting more difficult. ECMNet and GIMPS have picked off most of the
"easy" factors. I have two CPUs running ECM full-time. The last
Cunningham factor I found was last
But (assuming n is composite) no prime factor of n can be greater than
n^0.5. So how can n^0.6065 be the average?
(I hope I'm not showing my idiocy here! :)
Kyle Evans (newbie on this list)
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED]]On Behalf Of Jud
McCranie
Never mind. My idiocy is admitted. :)
It's the LOWEST prime factor that can't exceed n^0.5.
Sorry for the trouble.
Kyle E.
-Original Message-
From: Kyle Evans [mailto:[EMAIL PROTECTED]]
Sent: Sunday, January 23, 2000 4:51 PM
To: Jud McCranie; Pierre Abbat
Cc: [EMAIL PROTECTED]
But (assuming n is composite) no prime factor of n can be greater than
n^0.5. So how can n^0.6065 be the average?
(I hope I'm not showing my idiocy here! :)
No, that's not correct. If n is composite, then it *must have* a prime
factor n^.5, but it can (though not always) have one larger
At 04:51 PM 1/23/00 -0600, Kyle Evans wrote:
But (assuming n is composite) no prime factor of n can be greater than
n^0.5. So how can n^0.6065 be the average?
I'm not assuming that n is composite. Some of them are prime, and in that
case the largest prime number is the number itself, and that
Team M:
Has there been a reported run of MPrime on a PII/PIII XEON with at least 1M cache?
If so what, if any, was the improvement?
Regards,
Stefan S.
If you're factoring numbers in the 1165-1166 (bit) range, the first
factor could be anywhere in the root(1165) - root(1166) range i.e.
3413 - 3414 bits long !!
George's system prechecks to 2^52, and you are checking 2^52 - 2^64.
There's still a long way from 2^64 to 2^3413
If you're factoring numbers in the 1165-1166 (bit) range, the first factor
could be anywhere in the root(1165) - root(1166) range i.e. 3413 - 3414 bits
long !!
No, in the x-y bit range (remember that n bit integers are about 2^n) the
first factor could be x/2 to y/2 bits long
Sorry, I'm no mathematician, and new to the
Mersenne field.
No, in the x-y bit range (remember that n bit integers
are about 2^n) thefirst factor could be x/2 to y/2 bits long (powers of a
power multiply).
What I was trying to say in my disjointed way was
...
(Example) M11 = 2047 (11
17 matches
Mail list logo
