A note on primality tests for \(N=h\cdot 2^ n-1\)

DOI10.1007/BF01935653zbMath0814.11007OpenAlexW1970256974WikidataQ60174332 ScholiaQ60174332MaRDI QIDQ1338515

Øystein J. Rødseth

Publication date: 4 January 1995

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01935653

zbMATH Keywords

primality test

Mathematics Subject Classification ID

Factorization; primality (11A51) Primality (11Y11)

Related Items (4)

Binomial coefficients, roots of unity and powers of prime numbers ⋮ On a family of sequences related to Chebyshev polynomials ⋮ A primality test for \(4Kp^n-1\) numbers ⋮ Unnamed Item

Cites Work

• Tests for primality
• A Proof of the Lucas-Lehmer Test
• On Lucas's and Pepin's Tests for the Primeness of Mersenne's Numbers
• A Really Trivial Proof of the Lucas-Lehmer Test
• Lucasian Criteria for the Primality of  = h ⋅2 n - 1
• On Lucas's Test for the Primality of Mersenne's Numbers

This page was built for publication: A note on primality tests for \(N=h\cdot 2^ n-1\)