George,
Thanks for sending me the raw data for the round-off error distribution.
The empirical data fit the cumulative distribution function (introduced by
Brian Beesley) reasonably well with the value "N" of several hundred to a
thousand, which matches my understanding of about how many round-of
Just a quick note to thank Peter for his wonderful illustration of the
"repeating LL test remainders" question, with what I hope was a somewhat
surprising result!
> That is, S(32341) == S(1) mod M23.
> This is far more than 23 LL steps before the sequence repeats.
> EXERCISE: Repeat this anal
Jud McCranie wrote:
>
> At 02:52 PM 5/18/99 -0600, Aaron Blosser wrote:
>
> >So basically, it's just a poorly designed box. That's what you get for
> >buying Dell, but that's just my opinion :-)
>
> I've got 3 Dells, and I've run prime95 on at least two of them and I never had
> the problem.
"Blosser, Jeremy" wrote:
> Actually, I went and looked at the newsgroups and a few people posted about
> an apparently bad batch of 1226H monitors, and suggest sending them back and
> getting the P-990's instead. So if you have this monitor, perhaps that is
> the problem there...
Don't have that
Aaron Blosser wrote:
> If the problem were pervasive in many applications, I'd waste no time in
> calling Dell and asking for a fix. As it is, if only FPU intensive apps
> cause the problem, they probably wouldn't care.
It's not pervasive, and even other floating-point-intensive ops don't
trigg
Mersenne Digest Tuesday, May 18 1999 Volume 01 : Number 561
--
Date: Tue, 18 May 1999 02:31:24 -0400
From: [EMAIL PROTECTED]
Subject: Mersenne: Re: Mersenne Digest V1 #560
I can see two possible ways offhan
At 02:52 PM 5/18/99 -0600, Aaron Blosser wrote:
>So basically, it's just a poorly designed box. That's what you get for
>buying Dell, but that's just my opinion :-)
I've got 3 Dells, and I've run prime95 on at least two of them and I never had
the problem.
On the theory that at least one other person is interested in the
computational effort required to go after the EFF prizes for the larger
prime numbers, I made some rough extrapolations from George's "Status" table
and came to the following conclusions (generally to one significant figure):
Ten-
Does anybody have any source code to do large-number FFT in MVS 390
Assembler for IBM Mainframes?
I would like to use FFT to test Mersenne Primes on my 390 CPU but lack
the code, and I don't have any high-level language compilers. I just
have Assembler.
Any help would be appreciated.
Gary Die
>-Original Message-
>From: Aaron Blosser [mailto:[EMAIL PROTECTED]]
>Sent: Tuesday, May 18, 1999 3:52 PM
>To: Mersenne@Base. Com
>Subject: RE: Mersenne: Monitor Flicker on Dell P-II 450 MHz
>
>
>> > Sounds to me more like a "dirty" motherboard or power supply.
>> Chances are
>> > that the
Greg Czajkowski <[EMAIL PROTECTED]> writes:
> Hi, I have a question to the linux/mprime experts:
>
> I just installed RedHat 6.0, (it's awesome) but the only connection
> that machine has to the internet is PPP.
>
> Eventually, I got that to work. My question is whether there is any way
> to br
> > Sounds to me more like a "dirty" motherboard or power supply.
> Chances are
> > that the computer is emitting a lot of RF at high CPU load
> whether due to a
> > "dirty" (ie leaking) motherboard of a bad power supply. So I'd
> imagine it
> > doesn't satisfy some FCC Class whatever spec or some
> When I have something running that should grab all of the CPU cycles,
> Prime95 still gets about 3% of them. Is this because W95/98 won't let any
> one program hog all of the CPU?
its possible the nominally CPU bound application is causing at least *some*
page swapping, this would free CPU cyc
> Sounds to me more like a "dirty" motherboard or power supply. Chances are
> that the computer is emitting a lot of RF at high CPU load whether due to a
> "dirty" (ie leaking) motherboard of a bad power supply. So I'd imagine it
> doesn't satisfy some FCC Class whatever spec or something. I'd hav
Warning: My comments are not math related; feel free to delete this
message and curse my name for overstepping the mailing list charter.
Sorry.
> "Greg" == Greg Czajkowski <[EMAIL PROTECTED]>
> wrote the following on Mon, 17 May 1999 23:12:06 -0500
Greg> Hi, I have a question to the li
"Nicolau C. Saldanha" <[EMAIL PROTECTED]> writes
> Do you have more precise information, or do you know where we can find it?
> (the help function inside maple gives only a very superficial explanation)
> Strong pseudoprime wrt which base? Probably not random, or the search
> for a counterexample
On Mon, 17 May 1999, Chris Nash wrote:
(talking about how maple decides that a number is "probably composite")
> The test is now tougher. If MAPLE now identifies a probable prime, it tests
> again, to another base, and if that also passes, it performs a test using a
> Lucas sequence. Again these
Steve Johnson wrote:
>
> Some time ago someone on the list mentioned that would like to know
> about FFT. I recently picked up a book that presented Fourier
> Transforms (including FFT) in a very easy to understand format.
>
> It is called "Who is Fourier? A Mathematical Adventure".
>
> Altho
-Original Message-
From: Joe Decker [mailto:[EMAIL PROTECTED]]
Sent: Tuesday, May 18, 1999 10:09 AM
To: Curtis Cooper
Cc: [EMAIL PROTECTED]
Subject: Re: Mersenne: Monitor Flicker on Dell P-II 450 MHz
Curtis Cooper wrote:
> Has anyone noticed monitor flicker on a Dell OptiPlex GX1p
> P-II
Message text written by "Brian J Beesley"
>> >I think we should check the math first. I have a sneaky suspicion that
looping
> >won't occur in the relevant region (the first 2^n-3 iterations) unless n
is
> >composite - which may be interesting, but doesn't help us eliminate
Mersenne
> >numbers as
Curtis Cooper wrote:
> Has anyone noticed monitor flicker on a Dell OptiPlex GX1p
> P-II 450 MHz? We have installed ntprime on 16 of these
> computers and noticed the monitor flicker on each one.
> We know that the video chip is integrated on the motherboard
> so we cannot move the video card to
When I have something running that should grab all of the CPU cycles,
Prime95 still gets about 3% of them. Is this because W95/98 won't let any
one program hog all of the CPU?
+--+
| Jud McCranie [EMAIL PROTECTED] |
+--
Let me guess with a ATI rage on the motherboard?
All you can do is set them to factor (this doesn't create flickering) - we
have many gateway e3200 (with various PII chips in them) that all suffer
from this problem - but on the positive side our latest 3200 series (a PIII
450) is just fine!
Loui
Has anyone noticed monitor flicker on a Dell OptiPlex GX1p
P-II 450 MHz? We have installed ntprime on 16 of these
computers and noticed the monitor flicker on each one.
We know that the video chip is integrated on the motherboard
so we cannot move the video card to a different slot away
from the
Chris Nash <[EMAIL PROTECTED]> wrote:
> Define L(n)=(2+sqrt(3))^n+(2-sqrt(3))^n. It turns out that what we usually
> call *the* Lucas sequence is just
>
> S(n)=L(2^n).
Yes. We can check S(0) = L(1) = 4 and S(n+1) = S(n)^2 - 2
from the definitions. So S defines the familiar Lucas sequence
> The only way I can think of is having a script monitor the optional
> STDOUT of mprime and then checking whether it needs to contact the
> server.
I use the attached Tcl script to keep the last 25 lines of the output of mprime
in a file. You could put some commands in your crontab to check this
For those who think statistical methods could be useful treating of the
Mersenne problem (during the last weeks I have read some letters of this
kind in the Digests) I draw the attention to the following coincidence:
Browsing among the lines in the book of
N.J.Sloane ( Mathematics Research Cente
> >I think we should check the math first. I have a sneaky suspicion that looping
> >won't occur in the relevant region (the first 2^n-3 iterations) unless n is
> >composite - which may be interesting, but doesn't help us eliminate Mersenne
> >numbers as candidate primes. But my math is inadequat
28 matches
Mail list logo
