HTTP Error 403
403.9 Access Forbidden: Too many users are connected
This error can be caused if the Web server is busy and cannot process your
request due to heavy traffic. Please try to connect
again later.
Please contact the Web server's administrator if the problem persists.
Sounds like
All,
In the book _Primes and Programming_ Head's method of multiplying
two numbers mod n is mentioned. Is this actually more effiecient
than simply multiplying the two numbers and taking the modulus?
If so, is it implemented in the various mersenne factoring programs
in use?
Thankyou,
Lucas
At 06:59 08.07.99 -0400, Lucas Wiman wrote:
I think that we should put the publicity from the 38th mersenne prime
to good use. If we all write letters to the local paper, then we can
probably gain a very large number of people. Stick encouragements
to join on your website, in you .sig files,
all,
I think that we should put the publicity from the 38th mersenne prime
to good use. If we all write letters to the local paper, then we can
probably gain a very large number of people. Stick encouragements
to join on your website, in you .sig files, anywhere you can think
of. Be sure to
If you run prime there is under test and status a number that gives the
change to find a prime.
On which base is this number calculated?
bye
Paul van Grieken
Alcatel Telecom Nederland
afd: T-TAC NE Kamer:4121
Postbus 3292
2280GG rijswijk
Nederland
Phone: + 31 70 307 9353
Fax: + 31 70 307
At 06:19 AM 7/8/99 -0400, you wrote:
All,
In the book _Primes and Programming_ Head's method of multiplying
two numbers mod n is mentioned. Is this actually more effiecient
than simply multiplying the two numbers and taking the modulus?
Yes, because it keeps the numbers smaller. It was
NOW it does, after the official announcement Remember
when Roland found M37? Someone found a 0x000
residue in the report and beat George to the punch, so Scott
modified the reports so that they would NOT post a zero
residue automatically. So THIS time, when word came that
Peter-Lawrence.Montgomery wrote:
Problem A3 in Richard Guy's `Unsolved Problems in Number Theory'
includes this question, by D.H. Lehmer:
Let Mp = 2^p - 1 be a Mersenne prime, where p 2.
Denote S[1] = 4 and S[k+1] = S[k]^2 - 2 for k = 1.
Then S[p-2] == +-
On 8 Jul 99, at 9:51, Steinar H. Gunderson wrote:
HTTP Error 403
403.9 Access Forbidden: Too many users are connected
Sounds like M38 gave www.mersenne.org some extra traffic?
This problem has been around for a few days.
The other explanation is that the server has lost some TCP
Hello List:
I might be jumping the gun in here (as I have not read yet all the
Mersenne Digest #574. )
However.
These
are called
Sophie Germain primes, and it has been proven that there are an
infinite number
of them,
Source:[EMAIL PROTECTED]
AND
I'm not sure whether or not it has been
Actually I think mentioning the prize money might constitute
deception, since the next prize isn't in reach, yet. However, I agree
with your sentiment, except - _what_ "victory"?
It might be interpreted as a deception, I suppose...
"victory" would of course be finding another prime...
-Lucas
From: Lucas Wiman
However, I agree with your sentiment, except - _what_ "victory"?
It might be interpreted as a deception, I suppose...
"victory" would of course be finding another prime...
To me [read: disclaimer], 'victory' implies a successful end. Perhaps
'success' would get the idea
At 11:52 AM 7/8/99 -0700, Rudy Ruiz wrote:
I am not aware that anyone has yet proven the infinitude of Sophie
Germain Primes. [Granted that, in itself, does not mean anything ;)
I was wrong. As far as I know, it hasn't been proven either (but it is
almost certainly true). I had seen a
On Thu, 08 Jul 1999, Brian J. Beesley wrote:
On 8 Jul 99, at 6:19, Lucas Wiman wrote:
In the book _Primes and Programming_ Head's method of multiplying
two numbers mod n is mentioned. Is this actually more effiecient
than simply multiplying the two numbers and taking the modulus?
At 08:11 PM 7/8/99 -0400, Pierre Abbat wrote:
That is going to be a *lot* slower than FFT convolution, for numbers the size
of the Mersenne numbers we're testing!
Head's algorithm is for getting x*y mod n when 0=x,yn; and n is such that
nM but n^2M, where M is the largest integer you can store
Hi folks
In the book _Primes and Programming_ Head's method of multiplying
two numbers mod n is mentioned. Is this actually more effiecient
than simply multiplying the two numbers and taking the modulus?
Look at it this way. Head's method is essentially binary long
multiplication,
Limbs? It is good to know that the world has many different literal meanings
in many languages for "bits" - variety is good for us all. (The French word
for "buffer" is also, I seem to remember, rather amusing).
"Limb" is the term used in gmp for a digit in a large base (such as 2147483648)
Pierre Abbat writes:
In the book _Primes and Programming_ Head's method of multiplying
two numbers mod n is mentioned. Is this actually more efficient
than simply multiplying the two numbers and taking the modulus?
Look at it this way. Head's method is essentially binary long
18 matches
Mail list logo
