A note on primality testing using Lucas sequences
A note on primality testing using Lucas sequences
For an odd integer <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper N greater-than 1"> <mml:semantics> <mml:mrow> <mml:mi>N</mml:mi> <mml:mo>></mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">N > 1</mml:annotation> </mml:semantics> </mml:math> </inline-formula>, thought to be prime, a test is given which uses Lucas sequences and which can establish that any prime divisors of <italic>N</italic> are <inline-formula content-type="math/mathml"> …