From: Simon Spero <ses@tipper.oit.unc.edu>
To: cypherpunks@toad.com
Message Hash: 49d83b5ce623a6374f65955a6bd9b7c95278a133dd734967090a263f849e0028
Message ID: <Pine.SOL.3.91.960125170928.1505H-100000@chivalry>
Reply To: <199601252307.QAA15015@usr5.primenet.com>
UTC Datetime: 1996-01-27 19:58:03 UTC
Raw Date: Sun, 28 Jan 1996 03:58:03 +0800
From: Simon Spero <ses@tipper.oit.unc.edu>
Date: Sun, 28 Jan 1996 03:58:03 +0800
To: cypherpunks@toad.com
Subject: Prime Time....
In-Reply-To: <199601252307.QAA15015@usr5.primenet.com>
Message-ID: <Pine.SOL.3.91.960125170928.1505H-100000@chivalry>
MIME-Version: 1.0
Content-Type: text/plain
Something I ran across in an old book on number theory
In 1953 D.H.Lhmer used the SWAC calculator to check for Mersenne primes
(2^n-1). The largest one found was n=2281 - the runtime was 66 minutes.
Anybody with access to one of the new Cray fish-tanks want to get a
datapoint for the closest machine in 96 so we can check on how well
Moore's law worked?
Simon // Suddenly my Powerbook 140 seems fast again
Return to January 1996
Return to “Simon Spero <ses@tipper.oit.unc.edu>”