Succinct Proofs of Primality for the Factors of Some Fermat Numbers
- 1 January 1982
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 38 (157), 253-255
- https://doi.org/10.2307/2007482
Abstract
We give short and easily verified proofs of primality for the factors of the Fermat numbers ${F_5},{F_6},{F_7}$ and ${F_8}$.
Keywords
This publication has 4 references indexed in Scilit:
- Factorization of the Eighth Fermat NumberMathematics of Computation, 1981
- An improved Monte Carlo factorization algorithmBIT Numerical Mathematics, 1980
- Some Algorithms for Prime Testing Using Generalized Lehmer FunctionMathematics of Computation, 1976
- Every Prime Has a Succinct CertificateSIAM Journal on Computing, 1975