Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers

DOI10.1090/conm/022zbMath0659.10001OpenAlexW1984377013WikidataQ106153944 ScholiaQ106153944MaRDI QIDQ5966756

John L. Selfridge, Samuel S. jun. Wagstaff, D. H. Lehmer, B. Tuckerman, John Brillhart

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

zbMATH Keywords

tablesfactorizationcomputational number theoryprimality testing

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Primes (11A41) Algorithms in computer science (68W99) Tables in numerical analysis (65A05)

Related Items (38)

Prime clusters and Cunningham chains ⋮ Cunningham numbers in modular arithmetic ⋮ Differences of Harmonic Numbers and the $abc$-Conjecture ⋮ On some geometry of Mersenne primes ⋮ A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 ⋮ Computing special powers in finite fields ⋮ Indivisibility of the class number of a real abelian field of prime conductor ⋮ Properties of solutions to Pell’s equation over the polynomial ring ⋮ Constructing composition factors for a linear group in polynomial time ⋮ Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors ⋮ Efficient computer search of large-order multiple recursive pseudo-random number generators ⋮ Computing conjugacy classes of elements in matrix groups. ⋮ Primes that become composite after changing an arbitrary digit ⋮ On Computing Factors of Cyclotomic Polynomials ⋮ The Factorization of the Ninth Fermat Number ⋮ Elliptic Curves and Primality Proving ⋮ Generalized Repunit Primes ⋮ Gauss periods: orders and cryptographical applications ⋮ Aurifeuillian factorization ⋮ Existence of primitive 1-normal elements in finite fields ⋮ On the integers of the form $p^{2}+b^{2}+2^{n}$ and $b_{1}^{2}+b_{2}^{2}+2^{n^{2}}$ ⋮ Improved Techniques for Lower Bounds for Odd Perfect Numbers ⋮ All harmonic numbers less than \(10^{14}\) ⋮ On powers associated with Sierpiński numbers, Riesel numbers and Polignac's conjecture ⋮ Lehmer's totient problem over \(\mathbb{F}_q [x\)] ⋮ Upper bounds for the prime divisors of Wendt's determinant ⋮ On Orders of Optimal Normal Basis Generators ⋮ Finding Suitable Curves for the Elliptic Curve Method of Factorization ⋮ Repunit R49081 is a probable prime ⋮ Factoring with Two Large Primes ⋮ New Factors of Fermat Numbers ⋮ New Cullen Primes ⋮ Factors of Generalized Fermat Numbers ⋮ Three new factors of Fermat numbers ⋮ Generalized strong pseudoprime tests and applications ⋮ Factorization of the tenth Fermat number ⋮ Modular curves over number fields and ECM ⋮ Binomial coefficients and Lucas sequences

This page was built for publication: Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers