Factorization of the tenth Fermat number
Open Access
- 1 January 1999
- journal article
- research article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 68 (225) , 429-451
- https://doi.org/10.1090/s0025-5718-99-00992-8
Abstract
We describe the complete factorization of the tenth Fermat numberby the elliptic curve method (ECM).is a product of four prime factors with 8, 10, 40 and 252 decimal digits. The 40-digit factor was found after about 140 Mflop-years of computation. We also discuss the complete factorization of other Fermat numbers by ECM, and summarize the factorizations of.
Keywords
This publication has 52 references indexed in Scilit:
- An Implementation of the Number Field SieveExperimental Mathematics, 1996
- Factoring Integers with Large-Prime Variations of the Quadratic SieveExperimental Mathematics, 1996
- Succinct Proofs of Primality for the Factors of Some Fermat NumbersMathematics of Computation, 1982
- Factorization of the Eighth Fermat NumberMathematics of Computation, 1981
- An improved Monte Carlo factorization algorithmBIT Numerical Mathematics, 1980
- Algorithm 524: MP, A Fortran Multiple-Precision Arithmetic Package [A1]ACM Transactions on Mathematical Software, 1978
- Some Algorithms for Prime Testing Using Generalized Lehmer FunctionMathematics of Computation, 1976
- A monte carlo method for factorizationBIT Numerical Mathematics, 1975
- A Method of Factoring and the Factorization of F 7Mathematics of Computation, 1975
- Two New Factors of Fermat NumbersMathematics of Computation, 1975