Lucasian Primality Criteria

by Pedja

1 Primality Criteria
 √
m √
m 
Conjecture 1.1. Let Pm (x) = 2−m · x − x2 − 4 + x + x2 − 4 . Let M = 8kpn −1
such that k > 0, 3 ∤ k, p is a prime number , p ̸= 3, n > 2 and 8k < pn . Let Si = Pp (Si−1 ) with
S0 = P2kp2 (4) , then M is a prime iff Sn−2 ≡ 0 (mod M )
 √
m √
m 
Conjecture 1.2. Let Pm (x) = 2−m · x − x2 − 4 + x + x2 − 4 . Let M = 4kpn −1
such that k is an odd natural number , p is an odd prime number , n > 2 and 4k < pn . Let
Si = Pp (Si−1 ) with S0 = Pkp2 (6), then M is a prime iff Sn−2 ≡ 0 (mod M ) .
 √
m √
m 
Conjecture 1.3. Let Pm (x) = 2−m · x − x2 − 4 + x + x2 − 4 . Let N = 4kpn + 1
such that k > 0, 3 ∤ k, p is a prime number greater than 3 , n > 2 and 4k < pn . Let Si = Pp (Si−1 )
with S0 = Pkp2 (10) , then N is a prime iff Sn−2 ≡ 0 (mod N )

−m
 √
m √
m 
2
Conjecture 1.4. Let Pm (x) = 2 · x − x − 4 + x + x − 4 2 . Let N = 12kpn +1
such that k is an odd natural number , p is an odd prime number , n > 2 and 12k < pn . Let
Si = Pp (Si−1 ) with S0 = P3kp2 (4), then N is a prime iff Sn−2 ≡ 0 (mod N ) .
√ √ n
Conjecture 1.5. Let Pm (x) = 2−m · ((x − x2 − 4)m + (x + x2 − 4)m ) . Let Fp,n = (2p)2 + 1
, where p is a prime number greater than 5 and n > 1 . Let Si = P2p (Si−1 ) with S0 = Pp2 (8) ,
then Fp,n is prime iff S2n −2 ≡ 0 (mod Fp,n ) .