Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!ll-xn!adelie!axiom!linus!bs
From: bs@linus.UUCP (Robert D. Silverman)
Newsgroups: sci.math.symbolic
Subject: Re: Another factorization request.
Message-ID: <5@linus.UUCP>
Date: Sun, 16-Nov-86 09:48:13 EST
Article-I.D.: linus.5
Posted: Sun Nov 16 09:48:13 1986
Date-Received: Mon, 17-Nov-86 05:00:56 EST
References: <2380002@hpsadla.HP>
Organization: The MITRE Corporation, Bedford, MA
Lines: 32

> 1606937974174171729761809705564167968221676069604401795301376 =
> 	2 ^ 43 *
> 	17 *
> 	4937 *
> 	5434669 *
> 	400519950023277930387559326324618247	(approx. 4E35)
> 
> This last value is composite, but has no factors less than 5000000000 (5E9).
> At this point, further attempts at factorization using uMath have yielded
> nothing.  Neither of us has had a chance to impliment the more advanced
> factorization algorithms given by Knuth (The Art of Computer Programming,
> Vol. 2) to break it, although we hope to.  Meanwhile, would anyone else
> care to try?
> 
> I know this is a serious notes string, and apologize for what may appear a
> relatively trivial request.  But we would like to find the two (no more or
> less) factors of that last value (4.005..E35), and would greatly appreciate
> it if someone with the capabilities to do so would let us know what they
> are.
> 
> You can reach the source of this quandary (no e-mail - sorry!) at:
> 
> 	Robert G. Wilson, Jr.
> 	408 Century Plaza Building
Here's the factorization: It took about 40 sec on my SUN/3-75.
The algorithms in Knuth are obsolete.
 
 
4628238223878839
86538317746230817073
 
Bob Silverman