Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site lanl-a.UUCP
Path: utzoo!watmath!clyde!floyd!cmcl2!lanl-a!ttw
From: ttw@lanl-a.UUCP
Newsgroups: net.crypt,net.math
Subject: factors of seventy-one ones
Message-ID: <3117@lanl-a.UUCP>
Date: Thu, 8-Mar-84 15:20:59 EST
Article-I.D.: lanl-a.3117
Posted: Thu Mar  8 15:20:59 1984
Date-Received: Sat, 10-Mar-84 08:36:31 EST
Organization: Los Alamos National Laboratory
Lines: 16


              N = (factor 1)  *  (factor 2)
 
 N = 11111111111111111111111111111111111111111111111111111111111111111111111
 
 factor 1 = 241573142393627673576957439049
 factor 2 = 45994811347886846310221728895223034301839
 
 
   The above factorization of 71 ones was obtained on March 8,1984 by
Tony Warnock of Cray Research, Inc., using a Cray X-MP located at
Los Alamos National Laboratory.  The problem took 9.5 hrs using
a single CPU.  The code was written by Diane Holdridge and Jim Davis
of Sandia National Laboratory in Albuquerque and Tony Warnock of
Cray Reasearch, Inc.  The code used the Quadratic Sieve method of
Carl Pomerance.