A primality test for \(4Kp^n-1\) numbers

DOI10.1007/s00605-019-01354-xzbMath1461.11018OpenAlexW2990921071MaRDI QIDQ2287882

Daniel Sadornil, José María Grau, Antonio M. Oller-Marcén

Publication date: 22 January 2020

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00605-019-01354-x

zbMATH Keywords

primality testLucas sequencesProth numbersLucasian primality test

Mathematics Subject Classification ID

Algebraic number theory computations (11Y40) Factorization; primality (11A51) Primality (11Y11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit primality criteria for \(h \cdot 2^n \pm 1\)
• Primality test for numbers of the form \(A p^n + w_n\)
• Some primality tests that eluded Lucas
• A note on primality tests for \(N=h\cdot 2^ n-1\)
• Fast multiplication of large numbers
• Lucas's criterion for the primality of numbers of the form \(N = h2^ n - 1\)
• Fermat test with Gaussian base and Gaussian pseudoprimes
• The primality of certain integers of the form $2A r^n - 1$
• Cubic reciprocity and generalised Lucas-Lehmer tests for primality of 𝐴.3ⁿ±1
• Explicit primality criteria for $(p-1)p^n-1$
• Biquadratic reciprocity and a Lucasian primality test
• Testing numbers of the form N = 2kpm − 1 for primality
• A primality test for 𝐾𝑝ⁿ+1 numbers
• Lucasian Criteria for the Primality of  = h ⋅2 n - 1
• Some Prime Numbers of the Forms 2A3 n + 1 and 2A3 n - 1

This page was built for publication: A primality test for \(4Kp^n-1\) numbers