John Pierce writes:
the numerologists are at it again...
http://www.nature.com/nsu/030317/030317-13.html
I have a cold, which is making me grumpy. Of course, stuff like
this only tends to put me even further into Alexander Pope mode:
Kumar's team looked at the increments in the intervals
When the PrimeNet wavefront is near an FFT-length/exponent
breakpoint (as is currently the case with exponents ~17.7M),
project throughput is currently less than it could be, because
the server takes no account of the accuracy difference between
machines using the SSE2 code (currently that is only
Geoff Reynolds writes:
I am using mprime 22.12 on a pentium 166 MMX to do trial factoring. For the
exponents currently being assigned from primenet it takes this machine about
12 minutes to factor from 2^57 to 2^58.
I thought I would try factoring some small exponents (under 1,000,000) from
the
Naessens Yan wrote:
In this message, I assume FFT are complex FFT and are used to quickly
square numbers.
Let N=bp*B^p+...+b2*B^2+b1*B+b0.
You can store the digits b0, b1 ... bp in the real part of a complex signal
s1 and then apply a FFT on s1. Thus, the cost to square N is :
Anurag Garg writes (re. my GIMPS-related webpages)
- - I have been unable to reach his pages
Peter Montgomery replied:
How many times did you try, and over how long a period?
Last I heard, Ernst Mayer lived near San Jose, CA
Still true.
and kept the web pages on a home machine.
No longer
Hi, All:
John Pierce, owner of the hogranch.com domain, recently switched ISPs,
and somehow that is causing access problems. He suggested to me to
prepend a 'www.' to the domain name and that worked for me. So here
are the revised URLs:
GIMPS source code timing page:
Brian Beesley wrote:
{system 1}
[Wed Oct 30 21:00:54 2002]
UID: beejaybee/slug1, M8589491 completed P-1, B1=4, B2=42, WY2:
DE3C48D7
...
[Tue Nov 5 10:15:49 2002]
P-1 found a factor in stage #1, B1=4.
UID: beejaybee/slug1, M8589491 has a factor: 42333443925749970809
{system 2}
[Thu
http://story.news.yahoo.com/news?tmpl=storyncid=581e=1cid=581u=/nm/20021106/tc_nm/tech_certicom_contest_dc
Del Brand [EMAIL PROTECTED] wrote:
I always get asked what is the purpose or use for such large prime
numbers. Since I'm not a math geek, I don't know what to tell them.
Well, the prime numbers GIMPS has discovered are so overwhelmingly
large as to make them completely impractical for
Brendan Younger [EMAIL PROTECTED] wrote:
I know there has been some discussion on this list about the
theoretical possibility of staying in frequency space and doing a bunch
of point-wise squarings in there instead of computing the inverse DWT
after every iteration. Now, I'm not suggesting
In a message dated 9/10/2002 11:47:24 AM Pacific Daylight Time, [EMAIL PROTECTED] writes:
Let me see if I understand correctly. Most of the literature I've seen
dealing with NTTs for large-integer multiplication has always said to
pick a field with size (input values)^2 so that you get the
Tony Forbes writes:
We all know that A. Hurwitz discovered the Mersenne primes 2^4253 - 1
and 2^4423 - 1 in 1961.
(i) Were these the first two 1000+ digit primes discovered?
As far as I know, yes (note that M3217, discovered in 1957 by
Hans Riesel, was very close to 1000 decimal digits in
Naessens Yan [EMAIL PROTECTED] wrote:
Is it possible to do a DWT with NTT or the Scho"nhage-Strassen algorithm ?
Yes. There are quite a few posts in the archives on this topic.
I suggest you find and read them - they will likely answer many of
your questions.
Aside:
Re. the digest archives, in
If Spike Jones is reading this: Spike, what's your new e-mail address?
I tried sending you something at [EMAIL PROTECTED], but that
mail server says you're no longer one of their customers.
Cheers,
-Ernst
John R Pierce [EMAIL PROTECTED] (Hi, John!) writes:
interesting... Picked off a email newsletter on microprocessor design...
This thing sounds like it could *smoke* through Lucas-Lehmer FFT's...
*** Intrinsity Arrays 2GHz Adaptive Matrix ***
(rest snipped)
Man, who comes up with these stupid
http://www.cnn.com/2002/TECH/industry/05/21/supercomputing.future.idg/index.html
The theme of reducing transistor count without sacrificing much performance
is an interesting one. Some obvious possibilities I can think of, related to the
way typical CPUs do hardware arithmetic:
1) For
[There appears to be a problem with the mailing list. In an effort
to help Gordon Irlam track it down, I am attempting to resend this
message, which I first attempted to post last week. -EWM]
Hi, David:
David Sanders [EMAIL PROTECTED] wrote:
Mersenne primes are especially interesting to me.
Hi, David:
You wrote:
Mersenne primes are especially interesting to me. Just through simple
observation I found the relationship
If p is a prime, then p evenly divides 2^(p-1)-1
Of course, that should have read "If p is an odd prime..."
It has been interesting. I haver received a number of
p.s: Re. my previous message about roundoff errors, you
Prime95 users may be wondering why M18899929 would cause
roundoff warnings - after all, it's well within the safe
range of exponents for 1024K FFT length. The reason is
that I was using FFT length 960K, which Mlucas supports
as an
Alex Kruppa (a.k.a. 'the stud of TU Mu"nchen', at least according to his
e-mail address :) wrote:
A Pentium IV takes about 0.5 sec for this FFT (at 1.7 GHz).
That probably should read '0.05 sec,' which cuts you time estimate by
a factor of 10, i.e. brings it down to 24 hours. I suspect this is
I wrote:
For even-length convolutions, this trick fails, since we can only flip
an even number of signs this way, and a length-n acyclic has precisely
n*(n-1)/2 minuses, which is always an odd number.
Whoops, I'm afraid I let my typng get ahead of my brain there. That
should read "n*(n-1)/2
Brian Beesley writes:
Umm. Can someone please reassure me that we're not re-inventing
P-1 stage 1?
The algorithm under discussion does share some superficial
features with p-1, in that we do a bunch of a big-integer
modular multiplies followed by a gcd to extract any factors.
But in fact we
Recently, I've been playing around with the use of the Chinese
Remainder Theorem (CRT) to effect efficient short-length
convolution algorithms. For those of you not familiar with
CRT, a brief tutorial: given two length-n vectors,
A = [a_0, a_1, ... , a_(n-1)] and B = [b_0, b_1, ... , b_(n-1)],
Rich Schroeppel [EMAIL PROTECTED] writes:
The cost analysis of trial factoring by GCDs of 2^P-1 with the
product of many small candidate divisors ignores an important
optimization: All the candidates can be multiplied together
mod 2^P-1, and ONLY ONE GCD NEEDS TO BE DONE. The major cost is
Bruce Leenstra wrote:
What this list needs right now is a nice juicy math debate, so here goes:
I was reading the faq about P-1 factoring, and it talks about constructing a
'q' that is the product of all primes less than B1 (with some multiples?)
...
Right now Prime95 constructs a list of
Steve Harris (with Alex Kruppa for moral support and more importantly, to
run the tap and make sure the Steins stayed filled) wrote:
We finally got the picture, text, and translations approved by all involved,
so here is our report on the Munich chapter of the prime party of 7 december
(at least
Elias Daher wrote:
(2^2-1) is prime! (3)
(2^[2^2-1]-1) is prime! (7)
(2^[2^(2^2-1)-1]-1) is prime! (127)
(2^[2^(2^[2^2-1]-1)-1]-1) is prime! =
(170141183460469231731687303715884105727)
Chris Caldwell's webpage on Mersenne numbers has some information on
this old (and most likely untrue)
Luke Welsh wrote:
http://www.research.ibm.com/resources/news/20011219_quantum.shtml
Interesting...but the QC folks apprently seem to think classical factoring
work is frozen in time, viz. their comment about the supposed unfactorizability
of 200-digit composites. M727 is larger than 200 digits,
Dear All:
Well, the San Francisco Bay area GIMPS party last
Friday evening was a lot of fun, and included a couple
of surprise attendees who livened things up even more.
It was a lovely clear evening in Mountain View; GIMPS
members who showed up included Irv Rosenfeld (who flew
up all the way
Alex Kruppa wrote:
There is an _excellent_ article on the Heise Newsticker (in german).
This is one of the few I've seen that has all the facts right
[snip, or should I say, schnipp]
http://www.heise.de/newsticker/data/as-06.12.01-000/
Yeah, it's not bad, except that it says Scott K. did
Alex Kruppa also wrote:
Steve Harris and I will meet in Munich tonight and have a
Prost!! to the new prime. 6pm pacific time is 1am MET -
let's see if we can stay up to sync with the California
crowd for a toast!
Well, let me see here...Paul Landon and a bunch of other
math geeks will be
I'm still waiting to hear from a few people before I
finalize the venue. The time is set: 6pm Friday for
drinks and chit-chat, eat around 7.
-Ernst
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
OK, since I only received a location preference from one
person (thanks, Spike!), their vote gets counted:
WHAT: 3rd not-quite-annual San Francisco Bay Area GIMPS
Get-together
WHO: Any GIMPS member (we'll take your word for it :) or
prime number enthusiast. Bring a friend/spouse
p.s.: the reservation will be under the name Mersenne.
pps: I was hoping to be able to bill the whole thing to the
good friar's expense account, but the abbot said non
to that. Guess we'll have to pay for our own beer. :(
Whoops - when I wrote the original message, I forgot that
the source tarball for Mlucas 2.7c is still in the build
area of the ftp archive - it hasn't yet been promoted to
the release area. You can get it at
ftp://hogranch.com/pub/mayer/junk/Mlucas_2.7c.tar.gz
-Ernst
OK, the San Francisco Bay area GIMPS get-together will
take place this coming Friday, 7. December, in the south
bay area (precise venue to be decided soon - see below.)
Any GIMPS participant or Mersenne prime fan is welcome
to join us, along with anyone else you'd like to bring -
this is not a
Thomas Ritschel has been kind enough to build binaries of
Mlucas 2.7c for me. Now I need some guinea pigs, er, I
mean, beta testers. Thomas has built both 32-bit and
64-bit executables and verified that they run and done
timings on the R1 and R12000 systems he has access
to. These are all
Peter Montgomery wrote:
John R Pierce [EMAIL PROTECTED] listed some sites in Monterey.
So far, however, only he and I have expressed interest in that location.
Unless at least five mailing list members express interest in Monterey
by December 1, we should go elsewhere. Of course there
George Woltman wrote:
My computer has completed its unofficial verification. It checked out!
GIMPS' fifth prime - and just as exciting as the first one.
Congratulations and thanks to all GIMPS contributors. Everyone
of us had a hand in this remarkable find!
Now comes the hard
Spike Jones (hey, Spike!) wrote
Lets have a Bay Area GIMPS party!
Same place as before? Ill have the prime rib. {8-] spike
I'm game (well-seasoned venison, in fact :), but I believe
Luke Welsh is in worker drone limbo somewhere in the
Pacific northwest. Luke, can get your Weissbier-guzzling
Last night, one of the 2 mprime jobs I run on my Linux
PC at work died. It apprently died due to an illegal
sumout error. Now these are quite common, an normally
appear in my results.txt file in the form
Iteration: 1019208/10199069, ERROR: ILLEGAL SUMOUT
Possible hardware failure, consult the
I wrote:
Example: a typical construct in this part of the
algorithm is an integer-arithmetic sequence like
x = a + b
if(x c) x = x - c
On machines with a conditional move instruction one can use that
(i.e. calculate both a + b and a + b - c and pick one, based on the
result of the
Guillermo Ballester Valor [EMAIL PROTECTED] writes:
The increase in performance is moderate for most of platforms (0% to %5). For
Itanium (the STAR of the release) this version is almost twice faster than
2.8b.
Nice work on the IA64 optimizations, Guillermo! Actually, the Alpha
is another
I also wrote:
Next problem:
for non-power-of-two runlengths, the outputs of the
forward integer transform will occur in a fundamentally
different ordering than for the FFT, i.e. this wonderful
idea of the modular transform mirroring the floating FFT
is out the window when it comes to the
I wrote:
rather, one first has to use the corresponding modular
output to correct the bottom log2(q)/2 bits of the
floating output
If one has an approximate floating output and the same
number modulo q (exactly) in hand, the one can obviously
use the latter to correct up to the log2(q)
Alex Phillips [EMAIL PROTECTED] wrote
I recently updated my E450 running Mlucas to version 2.7b, using Bill
Rea's precompiled version from Ernst's website. I'm attempting to use the
mlcuas.cfg file which comes in this tarball, but I get the following error
in my p.stat file :-
George wrote:
For those Athlon owners that are not seeing a speed boost, try setting
CpuSupportsPrefetch=1
I also needed to do this on my C700 under WinMe to get
the expected speed boost. Timings dropped from 0.260 sec
at 640K to 0.188 sec. Nice work!
Alas, my dual-p3 office
Brian Beesley wrote:
If someone could merely demonstrate that, if the smallest factor of
c = 2^p-1 is 2kp+1 for some k, C = 2^c-1 and the smallest factor of
C with the form 2Kc+1 is 2Kc+1 for some K, then K k^x for some
x 0, this would show that searching for factors of C without
I'm catching up on sveral months' worth of digests, so some of
this has been covered by others.
On 23 April 2001, Brian J. Beesley wrote:
AFAIK the largest number currently known to be composite but with no
known factors is 2^33219281-1, the only 10 million digit Mersenne
number which has
This is interesting:
http://www.cnn.com/2001/TECH/ptech/03/30/langley.supercomputer/index.html
I wonder what the power dissipation for such a beast is?
Sure, each FPU one creates within the programmable logic
may run at only ~100-200 MHz (typical numbers for
high-end programmable logic), but if
I run Mlucas on several Sparcs under Solaris at work,
and I've noticed something not so nice about the Solaris
nice command. The lowest priority Solaris allows is 19,
which on any other Unix-like OS I've used would mean the
job in question only gets CPU cycles if no high-priority
processes are
Date: Sun, 25 Mar 2001 20:00 PST
To: [EMAIL PROTECTED]
Subj: small bug in Mlucas 2.7b error checking
In doing some testing of exponents very near the upper
limit of what Mlucas 2.7b allows for 640K FFT length,
I discovered a bug which in some case will allow per-
iteration roundoff checking to
To anyone running Mlucas on one of the new SunBlade
workstations:
Bill Rea writes:
I've had a call from Sun to say that SunBlades manufactured before
March 14 have a "bug" in the prefetch pipeline which, under very
rare circumstances, can give incorrect floating point results.
They have
For Mlucas users who (as I did) grabbed some of
the small exponents 4.51M which George put on
the server for triple-checking yesterday, note
that you'll want to add a line for 224K FFT length
to your mlucas.cfg file. For this runlength, this
available FFT radix sets are indexed 0-4; 0 works
best
This has probably already been posted to the list by
others, but as I get it in digest form, I can't say for
sure.)
http://slashdot.org/articles/01/03/17/1639250.shtml
The numberin question is a 1401-digit probable prime.
I've asked Phil Carmody whether it's been rigorously
proven prime, or
Jason Stratos Papadopoulos wrote (to Peter Montgomery):
Ernst Mayer and I exchanged many mailings about
using GF(p^2) when p = 2^61 - 1.
I thought he had implemented it, as part of a
mixed integer/complex FFT.
As I remember, he *had* implemented it but the project is in limbo
In my haste to thank the various folks who helped build the Mlucas
2.7b binaries and get *back* to bed, I forgot to thank John Pierce
for kindly hosting the ftp archive on his hogranch.com server.
Thanks, John!
And to all the others I've probably still forgotten to thank, thanks.
(Hopefully that
Dear GIMPSers:
I am pleased to announce Mlucas 2.7b (source code and binaries for
selected platforms) is available. See
ftp://hogranch.com/pub/mayer/README.html
ftp://hogranch.com/pub/mayer/gimps_timings.html
(768kbps capacity) or the mirror at
ftp://209.133.33.182/pub/mayer/README.html
George Woltman wrote:
George is working on it, but is a long way from completion. Progress is
slow, primarily due to my own laziness. My estimate for a 512K FFT is 0.4
seconds on a 1.4GHz P4. You can compare that to other machines at
http://www.mersenne.org/bench.htm.
Jeff Woods
Just my 2 cents' worth with respect to the screen saver
proposals: how about the following?
1) (This is along the lines of the popular "swarm of
bees" screensaver) Have some bee (or other - perhaps
allow the user to choose from a menu) icons move around
the user's computer screen according to
Check out
http://www.theonion.com/onion3311/microsoftpatents.html
At $0.10 per binary digit, the royalty fee GIMPS would
owe Microsoft for the last Mersenne prime is nearly
$70. Should we divide this equally amongst GIMPS
participants, or bill people proportionally to their
CPU-year
Jason Papadopoulos wrote:
The alpha was already at least 5x faster than a PIII for multiprecision
arithmetic at the same clock speed; with the P4 it will only get worse.
Brian Beesley replied:
Are you sure about this? I think, with Alpha, you have to execute the
instruction twice to get a
Check out:
http://www.cnn.com/2000/TECH/computing/10/12/britain.code.reut/index.html
Of course, for me to claim Paul Leyland and Torbjorn
Granlund as GIMPSers is a bit like the flea saying it
owns the dog, but both have had (direct or indirect)
involvement with the project in the past.
Does
I apologize in advance for the off-topic nature of this
posting, but I thought I'd ask this of the list I know
the best first:
Are any of our readers familiar with use of the various
containers in the C++ Standard Template Library (STL)?
I have a question about the use of one STL container,
the
Nacho [EMAIL PROTECTED] wrote:
I will have a SparcStation at work and I want to put it to do some useful
work with GIMPS.
{snip}
A SparcStation is not a very fast machine and I will have it only for 6
months, so perhaps it will not be very fast to do LL test in new exponents,
and perhaps
Dear prime seekers:
Thanks to Robert Deininger [EMAIL PROTECTED],
binaries of Mlucas 2.7a for Alpha/VMS are now available.
Documentation and needed links are in
ftp://hogranch.com/pub/mayer/README.html
If you have any problems with the ftp'ed files, make sure your browser or ftp utility
is
Check out
http://www.cnn.com/2000/TECH/computing/07/07/seti.implication.idg/index.html
-Ernst
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Jason Papadopoulos wrote:
Moving to IA64 will be a much bigger challenge than simply rewriting
half a meg of assembly language.
That's why I'm hoping the SGI open source compilers for IA-64 are decent
(see http://oss.sgi.com/projects/Pro64/ );
at least in the near-term one could then simply
Manual testers will be pleased to know that the PrimeNet
manual test forms appear to be working once again.
Thanks, Scott et al.
-ernst
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ --
Dear All:
As of a few hours from now, I am vacating my apartment for 9 days while
the property owners do some heavy-duty maintenance and repairs. My ftp
server will be off-line for that time.
John Pierce has kindly agreed to host my file archive on his server
for the next week-and-a-half.
Stefan Struiker wrote (re. the reliability of double-checking):
How many DDs does it take to "reasonably establish" primality, given the
apparent slight error in the L-L test? Is there an extra-precision
version of the test to nail things down?
A few years ago, you would likely have heard
I wrote:
Especially for large runlengths (and after the first few hundred iterations
or so), rounding errors tend to be randomly distributed in an approximately
Gaussian fashion,
Brian Beesley wrote:
I know perfectly well what you mean, but these two statements tend to
contradict each
Richard Otter wrote:
{snip}
M10068757 Roundoff warning on iteration 9803267 maxerr = 0.4375
M10068757 is not prime. Res64: AEED24F91193EE6F. Program: E2.7z
Your result is in all likelihood fine - I've done double-checks that
gave lots more roundoff errors of the 0.4375 variety
(That's a Monty Python reference, for those who are puzzled by the the subject line.)
Harald Alvestrand wrote:
one of the amazing things I discovered some years ago when browsing the
website of the Institute for Earth Rotation (!) is that leap seconds can't
be predicted more than
Martijn Kruithof [EMAIL PROTECTED] wrote:
You forget that most of the ice is on the poles, while the
water is so to say all around.
An excellent point. I was still thinking of hydropower reservoirs
while writing about the ice melting, and forgetting the implications
of the water getting
Stefan Struiker wrote:
A garland of 404s beyond the / of /ips. Yet results are still received,
and the Entropia Home page displays. Never knew I'd miss the weekend
stats so much.
Sigh,
Stefanovic
Martijn Kruithof wrote:
prepend www to entropia.com and it works
Yeah, I noticed
Dieter Schmitt wrote:
P-1 found a factor in stage #1, B1=25000, B2=275000.
M4428701 has a factor: 3035629975521900014017
It was found at stage 1 by V20 beta 4. I'd have
expected finding factors at lower bits first.
You're misunderstanding how the p-1 algorithm works.
p-1 run to stage 1
I wrote:
Come to think of it, factoring would be an excellent
application for a 21264 without an L2 cache, but I
don't know if they come that way (except perhaps in
a massively parallel setting, where the problem of
maintaining cache coherency in a multilevel cache
hierarchy often is
Nathan Russell wrote:
For those who don't know, due to CPU design reasons
that I don't claim to understand, factoring to 65 bits
takes easily four or five times as long as factoring
to 64 bits. In version 19, it was set to take place
for exponents 13.38M and up. I believe PrimeNet will
Brian Beesley writes (re. Mfactor):
I found that Mfactor on a 21164 was significantly
faster than Prime95 on a system which runs LL tests at
about the same rate. However the operational
inefficiencies caused by driving Mfactor manually
were outweighing this even before an improved LL
Brian Beesley (Mersenne Digest 715, 7. April) wrote:
There are also factoring programs available in portable
high-level-language source format, in particular look
for Mfactor.c If it wasn't for the fact that factoring
is so far ahead of LL testing, I'd probably switch my
Alpha system to
There's previously been several posts discussing the performance penalty
one suffers when running multiple LL tests on a multiprocessor system
with a single shared system bus. It would be interesting to see whether this
penalty could be alleviated in a reasonably cost-effective fashion through
Dear all:
Bill Rea just sent me a binary of Mlucas 2.7a which will run under
Solaris 2.5 - apparently a lot of the older Sparcs still run this
version of Solaris, and the binary compiled for Solaris 2.6 and 2.7
won't run under 2.5. This binary (like all the others) is available via
Dear Mersenners:
The source and binaries for selected platforms of Mlucas 2.7a are
now available: see
ftp://209.133.33.182/pub/mayer/README.html
Major changes from v2.7z include:
1) v2.7a has a radix-9 FFT pass capability. This allows one to
go from FFT lengths of (say) 256K and 512K to 288K
Siegmar Szlavik writes:
I have some bad news: I think I found a bug in Mlucas.
I also have some good news: it is not related to the test itself. :)
I had 2 unfinished exponents with savefiles and everything.
I copied all the stuff to a directory and started Mlucas, which
continued the work on
Ken Kriesel writes:
Participants in this phase of the QA should be willing to coordinate by
email with
a partner, running LLtests and double-checks of the same exponent in
parallel,
and cc George Woltman and myself, interim residues at suitable intervals.
Since you say you also want some
Jukka Santala wrote:
First of all, I take offence at the use of the term "hacker" here.
I would have thought most people following this list are knowledgeable
enough to make the distinction - what GIMPS for example does is hacking
Thanks for clearing me up on that - I was under the (apparently
Will however sent me a message within the last hour about compiling
Mlucas on a Sparc please resend it? I inadvertently hit 'delete' before having
read it, and it wasn't copied into my AOL old mail cache where I could
normally recover it from.
Reminder to Sparc users: unless you're interested in
Chris jefferson wrote:
And this is the reason why 'hackers' get such bad press. hackers are not
interested in "warez", "crackz" , or anything similar. The people who
wrote Linux were hackers, as were the people who originally wrote DOS (big
bill never was. =\ )
We are hackers here, we are
Dear all:
This is off-topic, except in the sense that it involves the ftp server where
I maintain the Mlucas software for mersenne testing Unix clients.
My ftp server has suffered its first (to my knowledge) hacker penetration.
I think I stopped the attack before any serious damage was done,
Bill Rea writes:
it does appear to some people that credit wasn't being
given which has led people to quit GIMPS for lack of appreciation of
their contribtions. I still can't quite figure out when the updates are
being done, but my guess is that those using the manual checkout/in
pages are only
(I sent the following to the list a few days ago, but it seems to have
gotten lost in the shuffle, so here it is again.)
Siegmar Szlavik ([EMAIL PROTECTED]) writes:
I downloaded the Mlucas executable for IRIX the other day to give our SGI
workstations some work to do, but unfortunately I get
Paul Landon wrote:
As an off-topic footnote, anyone interested in History or Biographies
should look up the some of the flowery characters mentioned above.
Some biographies have been "ethically cleansed" and have missing data,
data that should never be allowed to detract from their
Bill Rea wrote:
Do people using the manual check out forms get in the Top Producers
list? I ask because I've never been able to find myself in the list
and I had an email from a former GIMPS contributor who claimed he
got no credit for exponents tested through the manual check out/check in
Chris Nash wrote:
If y=f(x), the volume of revolution is given by
{snip}
Chris, you forgot to explicitly give that f(x) = 1/x, although one
can infer that from the rest of your psot.
Brain teaser:
Are there infinitely many smooth functions f(x) which have the same
volume as the classical
Brian Beesley wrote:
The optimization that should probably be done for Athlon is to
organize the code to allow FMUL FADD to execute in parallel (which
the Pentium II/III core just can't manage). This could give a speedup
of the order of 40%.
That would be nice if true, but I suspect it's a
Olivier Langlois wrote:
The bill to change the value of pi
to exactly three was introduced without fanfare by Leonard Lee
Lawson (R, Crossville), and rapidly gained support after a letter-writing
campaign by members of the Solomon Society, a traditional values group.
Note that ignorance,
I have put together a new (HTML) version of the Mlucas README file, which
I hope will make downloading the code(s) and manual testing (especially
for new users) easier. Please update your links/bookmarks accordingly.
Cheers,
-Ernst
ftp://209.133.33.182/pub/mayer/README.html
Jud McCranie wrote:
This is getting off topic, but:
The criteria for something to be patentable is that the average
practitioner in the field wouldn't think of it. So it boils down to
whether the average programmer would think of windowing, given the problem.
Well, that's the major criterion
Paul van Grieken wrote:
Last year there was a email about the new found prime.
I could read there was a second check to see if it was really a prime.
After that I did not see any result.
Can someone tell me what the status is of the last found mersenne prime.
just because I am curious about it.
1 - 100 of 147 matches
Mail list logo
