论文信息 - Tables of Fibonacci and Lucas factorizations - 字舞流文

Tables of Fibonacci and Lucas factorizations

We list the known prime factors of the Fibonacci numbers Fn for n < 999 and Lucas numbers Ln for n < 500. We discuss the various methods used to obtain these factorizations, and primality tests, and give some history of the subject.

Robert D. Silverman | J. Brillhart | P. L. Montgomery

[1] H. W. Lenstra,et al. Factoring integers with elliptic curves , 1987 .

[2] P. L. Montgomery. Modular multiplication without trial division , 1985 .

[3] J. Gerver. Factoring large numbers with a quadratic sieve , 1983 .

[4] Thorkil Naur. New integer factorizations , 1983 .

[5] H. C. Williams,et al. A $p+1$ method of factoring , 1982 .

[6] Hugh C. Williams,et al. Some algorithms for prime testing using generalized Lehmer functions , 1976 .

[7] John Brillhart,et al. Some miscellaneous factorizations , 1963 .

[8] H. Lenstra,et al. Primalitv Testing and Jacobi Sums , 2010 .

[9] D. H. Lehmer,et al. New Primality Criteria and Factorizations of 2 TM d = 1 By , 2010 .

[10] Robert D. Silverman. The multiple polynomial quadratic sieve , 1987 .

[11] P. L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization , 1987 .

[12] J. Brillhart,et al. A method of factoring and the factorization of , 1975 .