Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
From MaRDI portal
Publication:5966756
DOI10.1090/conm/022zbMath0659.10001WikidataQ106153944 ScholiaQ106153944MaRDI QIDQ5966756
D. H. Lehmer, John Brillhart, Samuel S. jun. Wagstaff, John L. Selfridge, B. Tuckerman
Publication date: 5 June 1993
Published in: Contemporary Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/conm/022
11-04: Software, source code, etc. for problems pertaining to number theory
11-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory
11B39: Fibonacci and Lucas numbers and polynomials and generalizations
11A41: Primes
68W99: Algorithms in computer science
65A05: Tables in numerical analysis
Related Items
Prime clusters and Cunningham chains, Generalized Repunit Primes, Gauss periods: orders and cryptographical applications, Finding Suitable Curves for the Elliptic Curve Method of Factorization, Factoring with Two Large Primes, New Factors of Fermat Numbers, Factors of Generalized Fermat Numbers, A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377, Computing special powers in finite fields, On Orders of Optimal Normal Basis Generators, New Cullen Primes, Three new factors of Fermat numbers, Aurifeuillian factorization, On some geometry of Mersenne primes, Generalized strong pseudoprime tests and applications, Binomial coefficients and Lucas sequences, Upper bounds for the prime divisors of Wendt's determinant, Repunit R49081 is a probable prime, On Computing Factors of Cyclotomic Polynomials, The Factorization of the Ninth Fermat Number, Elliptic Curves and Primality Proving, Improved Techniques for Lower Bounds for Odd Perfect Numbers, Factorization of the tenth Fermat number
