<>
Humans are notoriously good at finding patterns in cluttered data. Problem
is, they're also good at finding patterns in random data. This ability is
useful if you're strolling in a field and you see a flash of orange/black.
"Uh oh. Tiger. Run!". It is not useful if you're looking at a shad
Dear All:
Thanks to Brian Beesley <[EMAIL PROTECTED]> and Francois Jaccard, I have
Alpha/Linux binaries of Mlucas 2.7y available: see ftp://209.133.33.182/pub/
mayer/README for details. Brian reports that the binary should run under
both Linux V5 and V6. He hasn't yet sent me timings for non-powe
Mersenne Digest Wednesday, October 13 1999 Volume 01 : Number 642
--
Date: Tue, 12 Oct 1999 22:53:18 -0400 (EDT)
From: Darxus <[EMAIL PROTECTED]>
Subject: probability of primeness (was: Re: Mersenne: splitting up 1
> Can somebody give me the last few digits of the decimal expansion of
> (2^6972593)-1 so that I can verify my copy's intact ?
to find the last n base-d digits of M39, find
2^(6972593) (mod 10^d) -1
The last 100 digits of it are:
854323570491331747687718276359853562553418155924593120827624505017
Can somebody give me the last few digits of the decimal expansion of
(2^6972593)-1 so that I can verify my copy's intact ?
__
PGP fingerprint = 03 5B 9B A0 16 33 91 2F A5 77 BC EE 43 71 98 D4
[EMAIL PROTECTED] / http://w
> Are prime numbers prime in all bases ?
That is a deep question.
If by "base" and "prime" you are restricting yourself to the integers, the
answer is "yes".
If you allow yourself more freedom and allow other numeric quantities as
your "base", the answer is "not necessarily".
For example, in
On Tue, 12 Oct 1999, Aaron Blosser wrote:
> Some of us have volunteered to pony up some dough to give to the next person
> who finds a Mersenne Prime. This goes back to the way it was *before* the
> EFF prize. Since it'll be a while before we find a 10M digit prime (unless
> someone gets REAL
Some of this is likely to be based on the density of primes.
The "Prime Number Theorem" shows that the asymptotic density of primes is x
/ ln x.
This density is often written pi(x) [the lower case Greek letter, btw] with
pi(x) = (the number of primes less than or equal to x) / x.
This is not a
At 10:29 PM 10/12/99 -0500, Ken Kriesel wrote:
> What sort algorithm are those figures for? In what programming language?
>Which compiler?
It was insertion sort, based on Bentley's pseudocode, so it was the same
algorithm. I coded it in Pascal, he did it in C. I used Stony Brook
Pascal+ ver
I just communicated with the server, and got error 11 - exponent already
tested on one I'm 95% through with. (A few weeks ago I had to transfer
some exponents from one machine to another, so something may have gotten
mixed up in the process.)
Will this still count as a double check of that ex
At 12:16 AM 10/13/99 -0400, Darxus wrote:
>Are prime numbers prime in all bases ?
Yes. The base of the number is just how we write it - it is not the number
itself.
+-+
| Jud McCranie|
|
At 06:12 PM 10/12/99 -0700, you wrote:
>math stuff. Im in nerdvana here. So, thanks George. How
>about posting a picture of yourself so we can print it
>out and frame it? {8^D spike
http://www.utm.edu/research/primes/bios/bio.html#Woltman
__
12 matches
Mail list logo
