Hi all,
At 08:13 PM 7/20/99 -0700, Daniel Swanson wrote:
Iteration: 6128000/7812379, ERROR: ROUND OFF (0.4026489258) 0.40
[Tue Jul 20 16:35:33 1999]
Disregard last error. Result is reproducible and thus not a hardware
problem.
I consulted the readme file, but it wasn't very helpful. What is a
On 20 Jul 99, at 0:26, Luke Welsh wrote:
That would be me. But I don't like the money because I think it
opens a can of worms. ('can of worms' -- what do you say in
Russian or Japanese or Flemish?) I happen to like money (you
can buy beer with it and cover green fees).
Primenet is a
On 19 Jul 99, at 22:21, David M Einstein wrote:
You will want to do P-1 in addition to, and after seiving. It would be
foolish to use p-1 to discover a 30 bit factor.
Not half - trial factoring with numbers that small, and _very_
heavily constrained, is _extremely_ fast. I tested
On 19 Jul 99, at 18:40, Todd Sauke wrote:
Alex,
The group you seek always has 2^n elements. All bit combinations are
possible.
(P = 2^p-1 is "minus one" in n-bit words. 2*P is minus two, etc. up to
2^n*P which is 0. All bit patterns occur.)
Todd Sauke
In general, what you say is
I noticed something slightly different on the search status page at
http://www.mersenne.org/status.htm today (but it's probably been this way for a
while). The "Expected new primes" column got some new nonzero numbers in rows
where there are no exponents of unknown status.
I presume this is
FAQ author Lucas Wiman [EMAIL PROTECTED] writes
Well, this might not be a problem. If P-1 tries more than one base,
all that is required (per Mn) is *one* gcd. We just multiply the
remainders from the bases mod Mn, and then take the gcd on the final
remainders. We could have the
Hello Mersenne,
Sorry for bad english its not my native language, thanks.
I run mprime (or prime95 ntprime) on my laptop.
When I start the programm on my notebook it makes a strange mechanical
pulsing sound like an old damaged wheel or like an ill cricket.
The sound doesn't come out
