Factorization of the Eighth Fermat Number
- 1 April 1981
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 36 (154) , 627-630
- https://doi.org/10.2307/2007666
Abstract
We describe a Monte Carlo factorization algorithm which was used to factorize the Fermat number ${F_8} = {2^{256}} + 1$. Previously ${F_8}$ was known to be composite, but its factors were unknown.
Keywords
This publication has 4 references indexed in Scilit:
- An improved Monte Carlo factorization algorithmBIT Numerical Mathematics, 1980
- Some Algorithms for Prime Testing Using Generalized Lehmer FunctionMathematics of Computation, 1976
- A monte carlo method for factorizationBIT Numerical Mathematics, 1975
- Two New Factors of Fermat NumbersMathematics of Computation, 1975