New Integer Factorizations
- 1 October 1983
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 41 (164) , 687-695
- https://doi.org/10.2307/2007704
Abstract
New factorizations of Fibonacci numbers, Lucas numbers, and numbers of the form ${2^n} \pm 1$ are presented together with the strategy (a combination of known factorization methods) used to obtain them.
Keywords
This publication has 8 references indexed in Scilit:
- A p + 1 Method of FactoringMathematics of Computation, 1982
- Factorization of the Eighth Fermat NumberMathematics of Computation, 1981
- An improved Monte Carlo factorization algorithmBIT Numerical Mathematics, 1980
- Some Primes of the Form (a n - 1)/(a - 1)Mathematics of Computation, 1979
- Some Observations on Primality TestingMathematics of Computation, 1978
- Some Algorithms for Prime Testing Using Generalized Lehmer FunctionMathematics of Computation, 1976
- A monte carlo method for factorizationBIT Numerical Mathematics, 1975
- Theorems on factorization and primality testingMathematical Proceedings of the Cambridge Philosophical Society, 1974