Some primality tests that eluded Lucas

DOI10.1007/s10623-015-0088-0zbMath1364.11161OpenAlexW561113958MaRDI QIDQ887438

E. L. Roettger, Hugh C. Williams, Richard K. Guy

Publication date: 26 October 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-015-0088-0

zbMATH Keywords

primality testinglinear recurrence sequencesLucas functions

Mathematics Subject Classification ID

Recurrences (11B37) Sequences (mod (m)) (11B50) Primality (11Y11)

Related Items (5)

Unnamed Item ⋮ Unnamed Item ⋮ Efficient computation of terms of linear recurrence sequences of any order ⋮ A primality test for \(4Kp^n-1\) numbers ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Primality test for numbers \(M\) with a large power of 5 dividing \(M^{4}-1\).
• Some Extensions of the Lucas Functions
• On Principal Ideal Testing in Totally Complex Quartic Fields and the Determination of Certain Cyclotomic Constants
• SOME FOURTH-ORDER LINEAR DIVISIBILITY SEQUENCES
• New Primality Criteria and Factorizations of 2 m ± 1
• Determination of the Primality of N by Using Factors of N 2 ± 1
• A generalization of Proth's theorem
• Some Monoapparitic Fourth Order Linear Divisibility Sequences

This page was built for publication: Some primality tests that eluded Lucas