Tables of Fibonacci and Lucas Factorizations
Authors:
- John BrillhartJBJohn Brillhart
- Peter L. MontgomeryPMPeter L. Montgomery
- Robert D. SilvermanRSRobert D. Silverman
- 1 January 1988
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 50 (181) , 251-260
Abstract
We list the known prime factors of the Fibonacci numbers ${F_n}$ for $n \leq 999$ and Lucas numbers ${L_n}$ for $n \leq 500$. We discuss the various methods used to obtain these factorizations, and primality tests, and give some history of the subject.
Keywords
This publication has 11 references indexed in Scilit:
- Parallel implementation of the quadratic sieveThe Journal of Supercomputing, 1988
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers1988
- The Multiple Polynomial Quadratic SieveMathematics of Computation, 1987
- Speeding the Pollard and Elliptic Curve Methods of FactorizationMathematics of Computation, 1987
- Modular Multiplication Without Trial DivisionMathematics of Computation, 1985
- Primality Testing and Jacobi SumsMathematics of Computation, 1984
- New Integer FactorizationsMathematics of Computation, 1983
- Factoring Large Numbers with a Quadratic SieveMathematics of Computation, 1983
- A p + 1 Method of FactoringMathematics of Computation, 1982
- Some Algorithms for Prime Testing Using Generalized Lehmer FunctionMathematics of Computation, 1976