This paper presents three primality tests; Fermat test, Solovay-Strassen test, and Rabin-Miller test. Mathematica software is used to carry out the primality tests. The application of Fermat’s Litle Theorem as well as Euler’s Theorem on the tests was also discussed and this leads to the concept of pseudoprime. This paper is also discussed some results on pseudoprimes with certain range and do quantitative comparison. Those primality tests need to be evaluated in terms of its ability to compute as well as correctness in determining primality of given numbers. The answer to this is to create a source codes for those tests and evaluate them by using Mathematica 6.0. Those are Miller-Rabin test, Solovay-Strassen test, Fermat test and Lucas-Lehmer test. Each test was coded using an algorithm derived from number theoretic theorems and coded using the Mathematica version 6.0. Miller-Rabin test, SolovayStrassen test, and Fermat test are probabilistic tests since they cannot certainly identify the given number is prime, sometimes they fail. Using Mathematica 6.0, comparison study of primality test has been made and given the Miller- Rabin test as the most powerful test than other.
A primality test for $Kp^n+1$ numbers
