A Note on Primality Testing Using Lucas Sequences

For an odd integer $N > 1$, thought to be prime, a test is given which uses Lucas sequences and which can establish that any prime divisors of N are $\equiv \pm 1$ modulo the factored portion of $N + 1$.