Primality Test and an Algorithm Employed with Lucas Sequences

Lucas sequences and their requests are fault-finding in the inquiry of primality tests in number belief. Several famous tests for primality of natural number N utilising Lucas sequences established factorization of (N±1) [1][2] are possible. In this stage we present a primality test for different natural number N>1 by utilizing the set L(Δ,N) place L(Δ,N) is a set of S(N) specific pair of Lucas sequences (Vn(a,1),Un(a,1)), place S(N) for N=pe11⋅p2e2…pess is likely as S(N)=LCM[{piei−1(pi−(Δpi))}s i=1] and Δ=a2−4 for few established number a.

Author(s) Details:

P. Anuradha Kameswari,
Department of Mathematics, Andhra University, Visakhapatnam-530003, India.

B. Ravitheja,
Department of Mathematics, Andhra University, Visakhapatnam-530003, India.

Please see the link here: https://stm.bookpi.org/RHMCS-V3/article/view/8874

Keywords: Lucas sequences, Lucas addition chains, primality testing