Some Factorizations of 2 n ± 1 and Related Results
From MaRDI portal
Publication:5523028
DOI10.2307/2003473zbMath0146.04903OpenAlexW4246643307WikidataQ114042865 ScholiaQ114042865MaRDI QIDQ5523028
John Brillhart, John L. Selfridge
Publication date: 1967
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2003473
Related Items (11)
Unique representation of primitive factors of 2 n −1,n ODD, in certain quadratic forms ⋮ Some Primes with Interesting Digit Patterns ⋮ Algebraic theory of block codes detecting independent errors ⋮ Fast verification, testing, and generation of large primes ⋮ Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors ⋮ The influence of computers in the development of number theory ⋮ On the Use of Reducible Polynomials as Random Number Generators ⋮ On factorisation, with a suggested new approach ⋮ Sequences of numbers generated by addition in formal groups and new primality and factorization tests ⋮ An Overview of Factoring ⋮ Primitive Binary Polynomials
This page was built for publication: Some Factorizations of 2 n ± 1 and Related Results
