I'm curious - had this already been tested by
someone else using the defective v17 software?
Randy Given
[EMAIL PROTECTED]
http://members.aol.com/GivenRandy
public key at http://members.aol.com/GivenRandy/pgpkey.asc
Unsubscribe
At 07:19 05.07.99 -0400, [EMAIL PROTECTED] wrote:
I'm curious - had this already been tested by
someone else using the defective v17 software?
No.
/* Steinar */
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
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] == +- 2^((p+1)/2) mod Mp.
Predict which congruence occurs.
Dear Peter and All,
This is as far as I can go in Ubasic:
p Result
3 +
5 +
7 -
13 +
17 -
19 -
31 +
61 +
89 -
107 -
127 +
Dear All,
Following up my own msg here.
First, there is an obvious linear relationship between my two
conjectures, so they are equivalent.
Second, predictions where possible (U=Unknown):
p (p+1)/2 mod 31 Conj 1 (p-2) mod 31 Conj 2
4423 11 U 19 U
9689 9 - 15 -
9941 11 U 19 U
11213 27 U
Mersenne Digest Monday, July 5 1999 Volume 01 : Number 593
--
Date: Sat, 03 Jul 1999 13:57:08 -0700
From: Eric Hahn [EMAIL PROTECTED]
Subject: Mersenne: Prime95 and speed
Has anyone else noticed Prime95
I was just about going to ask if George was going to
more factoring assignments available to IPS or if
IPS just wasn't showing ones that had been made
availabe, when I noticed that the range of
10.0 - 10.2 Mil was posted.
Now instead of having enough for about 2 weeks,
there are enough for
(Note to Scott - create a dummy non-zero residue a stick it
in the cleared exponents report).
Too late!! The Cleared Exponents Report reads:
6972593 62 P 0x 01-Jun-99 13:57 nayan precision-mm
Unsubscribe
