Mersenne: oh great, here we go again!

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

Mersenne: re: EE Times reports Faster Multiplication

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 versi

Mersenne: RE: Mersenne Digest V1 #815

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 __

RE: Mersenne: Trouble with new DSL connection, Part 2

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

RE: Mersenne: New Lucas-Lehmer test program.

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 t

Mersenne: Permanent Archive

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

Mersenne: Scientific American: Distributed Computing

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

Mersenne: RE: Fibonacci Series

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 num

Mersenne: GIMPS in Dallas Morning News

GIMPS (along with SETI@Home and everything else) made it in the Dallas Morning News in the 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).

Mersenne: Vaxen & Intel

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, [EMAI

Mersenne: Billions and Billiards

Title: Billions and Billiards >US: million 10^6, billion 10^9, trillion 10^12 ... > >Non-US: million 10^6, milliard 10^9, billion 10^12, > billiard 10^15, trillion 10^18 ... That's why a billiard table is so big!

Mersenne: RE: Mersenne Digest V1 #584

[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: Starting at about M13, you see that there are indeed islands: Given the strong linearity of "log(exponents of mersenne primes)", it is not surprising that the av

Mersenne: re: Island Theory...Settled?

Luke Welsh writes: TTBOMK, the theory was never formalized. Regardless, Peter Lawrence Montgomery settled the issue: http://www2.netdoor.com/~acurry/mersenne/archive2/0032.html I assume that the island theory was settled in the negative? I have read the post, and others. Instead of

Mersenne: Java Prime and lotsa questions

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 language/compile

Mersenne: Java Ports?

Some of the new bench equipment coming out (scopes, analyzers, etc.) now run Java too. Many are connected to the network (for data transfer and PC control). Utilization is about 10%. H. And I can't wait until I get my net-aware refrigerator running LL tests ;) But what I really want is for s

Mersenne: Is 2 mod ((2^p) - 1) square?

Benny Van Houdt asked about checking 2 mod Mp for "square-ness". [digest #537] The hard way is to square every number from sqrt(Mp) to Mp-1, mod Mp, for equality to 2. This will take ~`(Mp-sqrt(Mp)) square/mod operations, or O(Mp)...too long. Another way to look at this: if x == 2 (mod Mp), then

Mersenne: re: Spin Structures on Riemann Surfaces

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

Mersenne: Net Abuse

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 tho

Mersenne: fast machines & nuclear stockpiles

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 onl

Mersenne: Even composites

At 12:59 AM 10/17/98 -0400, Foghorn Leghorn wrote: > >Second, I see that there are now some composite exponents in the ECM >factoring page. Why are none of them even? Is there a technical reason >that makes them less interesting? Yes. 2^n-1 is 1 mod 2, therefore 2 is never a factor of 2^n-