You are assuming the government makes sense?
David L Nicol wrote:
Jukka Tapani Santala wrote:
The fastest unclassified machine at the moment is
...
used for modeling nuclear
processes, "to maintain USA's nuclear stockpiles without the need of
further nuclear tests".
Am I the only one to
I think Mr. Derbyshire is trying to prove that he is neither
of the adjectives in his tagline.
I was having a lot of fun reading this list. I don't look
forward to the day when it isn't any fun anymore.
For myself, I would rather be silent and
Matthew A Lewis wrote:
this is a new preprint on the los alamos preprint server that may
interest some of you.
it deals with the sequence of perfect numbers (and hence Mersenne
primes) and whether or not it is finite...
math-ph/9812027
Spin Structures on Riemann Surfaces and the
Since the heavyweights here seem to be involved with finals and such, let me
get you started on your answers...
a) [skipping, I don't know]
b1) Using "properly sized" FFT: Yes, I believe using properly sized FFT's
saves some time. How much depends on the programmer, the data, the
[On the off chance that no one else has replied to this since it was
received...]
On Sat, 19 Jun 1999 12:55:46, Jeff Woods wrote:
snip
Starting at about M13, you see that there are indeed islands:
snip some more
Given the strong linearity of "log(exponents of mersenne primes)", it is not
Title: Mersenne: Vaxen Intel
Didn't some Vaxen come with vector array processors? Wouldn't this speed up some aspects of the LL testing (such as frequency domain squarings)?
~
Shaun Griffith, Texas Instruments MSP Multimedia,
GIMPS (along with SETI@Home mailto:SETI@Home and everything else) made it
in the Dallas Morning News in the Person@l mailto:Person@l Technology
section (print version).
Maybe someone can search the online version at http://www.dallasnews.com/
for the story (I don't have time this morning).
Ian McLoughlin wrote:
Since the list is quiet...
Does a Fibonnacci series contain a finite or an infinite number of primes?
From what I understand..
In a gen.F sequence if the first two numbers are divisible by a prime all
its numbers are divisible by the same prime, if the first two numbers
Title: Mersenne: Scientific American: Distributed Computing
The April edition of Scientific American has an article on distributed computing:
http://www.sciam.com/2000/0400issue/0400scicit5.html
-Shaun
Title: Permanent Archive
John R. Pierce wrote:
do you guys want to setup a permanent archive? I have plenty of disk space
on my linux server (768/768kbps SDSL)
Yes, let's do so!
-Shaun
Title: RE: Mersenne: New Lucas-Lehmer test program.
Brian Beesley wrote:
Griffith, Shaun wrote:
One drawback is the possibility of comparing apples to oranges, i.e., one
combination running with a different system loading than another.
A real, practical problem related
Title: RE: Mersenne: Trouble with new DSL connection, Part 2
Bob Margulies wrote:
The standard advice on 2250 is to switch from RPC to HTTP protocol. I
was already using HTTP protocol, so this doesn't apply. As an
alternative it suggests I set up a proxy server. In order to do this, I
On Thu, 08 Feb 2001 23:09:51 -0500, George wrote:
George is working on it, but is a long way from completion. Progress is
slow, primarily due to my own laziness.
George might be overclocked -- he is referring to himself in the 3rd person
(indirect register mode?).
-Shaun
Luke Welsh wrote:
The EE times (www.eet.com) reports:
Research by a team of U.K. mathematicians has produced a different
approach to two of the most fundamental aspects of electronic computation:
hardware addition and multiplication.
Can anyone tell me how to find the online version? I
John R Pierce [EMAIL PROTECTED] wrote:
the numerologists are at it again...
http://www.nature.com/nsu/030317/030317-13.html
I wonder if they tried checking it against the Lucky Numbers
(http://mathworld.wolfram.com/LuckyNumber.html)??
Also, wasn't there someone who did some analysis on a list
15 matches
Mail list logo
