[Primes Home][Home]
In the Lehmann test [1] we select values of \(a\) and show that \(a^{(n-1)/2} \pmod {n}=\pm 1\) for a prime number (\(n\)). We will select different sizes of prime numbers and test them by generating up to 100 random values of \(a\).