Lucas sequences and their requests are critical in the examination of primality tests in number theory. Several famous tests for primality of natural number N utilising Lucas sequences based on factorization of (N±1) [1][2] are possible. In this chapter we present a primality test for odd natural number N>1 by utilizing the set L(Δ,N) where L(Δ,N) is a set of S(N) obvious pair of Lucas sequences (Vn(a,1),Un(a,1)), where S(N) for N=pe11⋅p2e2…pess is likely as S(N)=LCM[{piei−1(pi−(Δpi))}s i=1] and Δ=a2−4 for some 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
