Article View: sci.math.num-analysis
Article #33Re: Euclid's Algorithm WANTED!!!
From: Robert D. Silverman
Date: Thu, 29 Oct 1992 13:30
Date: Thu, 29 Oct 1992 13:30
16 lines
1235 bytes
1235 bytes
In article <1d=1=yh@rpi.edu> maniattb@cs.rpi.edu (Bill Maniatty) writes: >Tom Valente at R.P.I. recently factored a Titanic Prime (1111 digits long). >You might want to check his PhD. thesis if you need to do really large numbers. I usually find that factoring primes is a waste of time........... I also do not consider 1000 digits "really large". For numbers of this size, the binary GCD method [See Knuth, as always!] works quite well. It is probably faster than FFT-based methods. -- Bob Silverman These are my opinions and not MITRE's. Mitre Corporation, Bedford, MA 01730 "You can lead a horse's ass to knowledge, but you can't make him think"
Technical Details
Message-ID:
<1992Oct29.133042.25380@linus.mitre.org>Path:
arc1-ca.pugleaf.net!sparky!uunet!gatech!usenet.ins.cwru.edu!agate!linus!linus.mitre.org!gauss!bsReferences:
<2030@eagle.ukc.ac.uk> <1992Oct27.144718.29608@linus.mitre.org> <1d=1=yh@rpi.edu>Show Full Headers
Complete Article Headers
Newsgroups: sci.math.num-analysis Path: arc1-ca.pugleaf.net!sparky!uunet!gatech!usenet.ins.cwru.edu!agate!linus!linus.mitre.org!gauss!bs From: bs@gauss.mitre.org (Robert D. Silverman) Subject: Re: Euclid's Algorithm WANTED!!! Message-ID: <1992Oct29.133042.25380@linus.mitre.org> Sender: news@linus.mitre.org (News Service) Nntp-Posting-Host: gauss.mitre.org Organization: Research Computer Facility, MITRE Corporation, Bedford, MA References: <2030@eagle.ukc.ac.uk> <1992Oct27.144718.29608@linus.mitre.org> <1d=1=yh@rpi.edu> Date: Thu, 29 Oct 1992 13:30:42 GMT Lines: 16