New integer factorizations
HTML articles powered by AMS MathViewer
- by Thorkil Naur PDF
- Math. Comp. 41 (1983), 687-695 Request permission
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.References
- Richard P. Brent, An improved Monte Carlo factorization algorithm, BIT 20 (1980), no.ย 2, 176โ184. MR 583032, DOI 10.1007/BF01933190
- Richard P. Brent and John M. Pollard, Factorization of the eighth Fermat number, Math. Comp. 36 (1981), no.ย 154, 627โ630. MR 606520, DOI 10.1090/S0025-5718-1981-0606520-5
- John Brillhart, D. H. Lehmer, and J. L. Selfridge, New primality criteria and factorizations of $2^{m}\pm 1$, Math. Comp. 29 (1975), 620โ647. MR 384673, DOI 10.1090/S0025-5718-1975-0384673-1 D. Jarden, Recurring Sequences, 3rd ed., Riveon Lemathematica, Jerusalem, 1973. D. H. Lehmer, Letter of July 14, 1982.
- Michael A. Morrison and John Brillhart, A method of factoring and the factorization of $F_{7}$, Math. Comp. 29 (1975), 183โ205. MR 371800, DOI 10.1090/S0025-5718-1975-0371800-5 T. Naur, Integer Factorization, DAIMI PB-144, Dept. of Computer Science, University of Aarhus, Denmark, 1982.
- J. M. Pollard, Theorems on factorization and primality testing, Proc. Cambridge Philos. Soc. 76 (1974), 521โ528. MR 354514, DOI 10.1017/s0305004100049252
- J. M. Pollard, A Monte Carlo method for factorization, Nordisk Tidskr. Informationsbehandling (BIT) 15 (1975), no.ย 3, 331โ334. MR 392798, DOI 10.1007/bf01933667 J. M. Pollard, Letter of July 27, 1982. B. D. Shriver & P. Kornerup, A Description of the MATHILDA Processor, DAIMI PB-52, Dept. of Computer Science, University of Aarhus, Denmark, 1975. S. S. Wagstaff, Letters of July 20 and 26, 1982.
- H. C. Williams, A $p+1$ method of factoring, Math. Comp. 39 (1982), no.ย 159, 225โ234. MR 658227, DOI 10.1090/S0025-5718-1982-0658227-7
- H. C. Williams and R. Holte, Some observations on primality testing, Math. Comp. 32 (1978), no.ย 143, 905โ917. MR 476625, DOI 10.1090/S0025-5718-1978-0476625-0
- H. C. Williams and J. S. Judd, Determination of the primality of $N$ by using factors of $N^{2}\pm 1$, Math. Comp. 30 (1976), no.ย 133, 157โ172. MR 396390, DOI 10.1090/S0025-5718-1976-0396390-3
- H. C. Williams and J. S. Judd, Some algorithms for prime testing using generalized Lehmer functions, Math. Comp. 30 (1976), no.ย 136, 867โ886. MR 414473, DOI 10.1090/S0025-5718-1976-0414473-6
- H. C. Williams and E. Seah, Some primes of the form $(a^{n}-1)/(a-1)$, Math. Comp. 33 (1979), no.ย 148, 1337โ1342. MR 537980, DOI 10.1090/S0025-5718-1979-0537980-7 M. C. Wunderlich & J. L. Selfridge, "A design for a number theory package with an optimized trial division routine," Comm. ACM., v. 17, 1974, pp. 272-276.
Additional Information
- © Copyright 1983 American Mathematical Society
- Journal: Math. Comp. 41 (1983), 687-695
- MSC: Primary 11Y05
- DOI: https://doi.org/10.1090/S0025-5718-1983-0717713-2
- MathSciNet review: 717713