I have found 12,209 new factors in the range of Brian's 10,000,000+ digit.
All of the other primes in this ranges have tested through 2^45.
They are avalaible at:
http://www.tasam.com/~lrwiman/fact45
or
http://www.tasam.com/~lrwiman/fact45.gz
These just include the new factors.
-Lucas Wiman
It's "testing" 2^25,000,009 - 1 right now. It can test one factor every 1.3
seconds. AUGH! At that rate it would take 95 *billion* years to trial divide
by all odd numbers under 2^62. Nooo
Don't forget, it's not just odd numbers, you only need to trial divide by
numbers that end in 1, 3,
Great! Can we get FPGA chips at Digikey or Mouser? How much do they go
for?
-Chuck
On Fri, 18 Jun 1999, Aaron Blosser wrote:
My understanding is that it comes with a language of its own. My
impression is that it is an icon based language. Kind of like connect the
blocks into a flow
The one I used is from Viewlogic (www.viewlogic.com). They have a full set
of programs for designing, simulating, routing and programming FPGA's. It
is a VERY nice set of tools, but as you might guess, VERY expensive as well.
I did just order a 30 day evaluation CD from them though...it's
Will change the "engine" to keep going to 2^33 after finding the
first factor report the results from that.
OK, here's the results. (All factors to 2^33 found, input is 159,975
largest primes 36 million)
Sieve 6 smallest primes, 3517525 calls, 40.15s
Sieve 10 smallest primes, 2972446
Brian J. Beesley writes:
I put a development version on my anon ftp server about three days
ago. ftp://lettuce.edsc.ulst.ac.uk/gimps/DecaMega/factor95.c
Um, that's an unfortunate choice of name; George's P-1 factorer is
"Factor95" (though there's a newer version, renamed to Factor98).
Only HP and Solaris. :( Why don't they release the source and let me
compile it
myself? Maybe gEDA will include such a program.
if you are paying $50,000 to $100,000 a seat for a program, you BUY the
computer it needs.
Other vendors of similar FPGA software include Vantis (formerly AMD's PAL
At 12:42 AM 6/21/99 +0200, Otto Bruggeman wrote:
Sorry to bother you people with this but can anybody tell me why my celeron
400 all of a sudden slows to (almost) half speed when it reaches the
1,000,000,000 (actually a little more, i guess it's around 2^30) mark in
factoring numbers??? My
At 03:53 PM 6/20/99 -0700, Luke Welsh wrote:
As long as we're fitting data to a curve, how about substituting
pi/2 for 3/2?
If you fit the curve to the data, 3/2 works a lot better. The best fit is for
a slope of 1.4785, which has a very high correlation coefficient of 0.996.
Mersenne Digest Sunday, June 20 1999 Volume 01 : Number 585
--
Date: Sat, 19 Jun 1999 13:43:34 -0700
From: Will Edgington [EMAIL PROTECTED]
Subject: Re: Mersenne: TI-92 Factoring, again
Brian J. Beesley
Sorry to bother you people with this but can anybody tell me why my celeron
400 all of a sudden slows to (almost) half speed when it reaches the
1,000,000,000 (actually a little more, i guess it's around 2^30) mark in
factoring numbers??? My p233mmx slows about 15 percent.
I'm just
At 08:41 PM 6/20/99 -0400, lrwiman wrote:
Doubtful, since the LL remainder never goes above Mp. The only thing that
inherantly increases is the iteration count, which takes up about log_2(p)
bits. Not that much...
P.S. 2^30 is ~100,000,000
not ~1,000,000
Actually 2^30 is ~ 1,000,000,000.
Sorry to bother you people with this but can anybody tell me why my celeron
400 all of a sudden slows to (almost) half speed when it reaches the
1,000,000,000 (actually a little more, i guess it's around 2^30) mark in
factoring numbers??? My p233mmx slows about 15 percent. The numbers
currently
13 matches
Mail list logo
