Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
From MaRDI portal
Publication:3043212
DOI10.1090/conm/022zbMath0527.10001OpenAlexW1984377013WikidataQ106153944 ScholiaQ106153944MaRDI QIDQ3043212
D. H. Lehmer, John Brillhart, B. Tuckerman, John L. Selfridge, Samuel S. jun. Wagstaff
Publication date: 1983
Published in: Contemporary Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/conm/022
Software, source code, etc. for problems pertaining to number theory (11-04) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Primes (11A41) Algorithms in computer science (68W99) Tables in numerical analysis (65A05)
Related Items (30)
Widely Digitally Stable Numbers ⋮ Unnamed Item ⋮ Old and new conjectured diophantine inequalities ⋮ Hyperelliptic cryptosystems ⋮ A role for generalized Fermat numbers ⋮ Tables of Fibonacci and Lucas factorizations ⋮ Small Two-Variable Exponential Diophantine Equations ⋮ Some uses of microcomputers in number theory research ⋮ A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier ⋮ Midpoint-free subsets of the real numbers ⋮ A Practical Analysis of the Elliptic Curve Factoring Algorithm ⋮ A new lower bound for odd perfect numbers ⋮ Investigating results and performance of search and construction algorithms for word-based LFSRs, \(\sigma\)-LFSRs ⋮ Gaussian Mersenne and Eisenstein Mersenne primes ⋮ A parallel version of the continued fraction integer factoring algorithm ⋮ Covers of the integers with odd moduli and their applications to the forms $x^{m}-2^{n}$ and $x^{2}-F_{3n}/2$ ⋮ Speeding up the computations on an elliptic curve using addition-subtraction chains ⋮ Primitive Polynomials Over Finite Fields ⋮ Sequences of numbers generated by addition in formal groups and new primality and factorization tests ⋮ Optimal characteristic polynomials for digital multistep pseudorandom numbers ⋮ A new family of BIBDs and non-embeddable (16,24,9,6,3)-designs ⋮ Factoring with the quadratic sieve on large vector computers ⋮ Factoring with Cyclotomic Polynomials ⋮ Maximal sets of mutually orthogonal Latin squares ⋮ Factoring on a computer ⋮ Elliptic curve cryptosystems and their implementation ⋮ An Overview of Factoring ⋮ Factorization Using the Quadratic Sieve Algorithm ⋮ Some Pseudoprimes and Related Numbers Having Special Forms ⋮ Parameter Determination for Complex Number-Theoretic Transforms Using Cyclotomic Polynomials
This page was built for publication: Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
