FERMAT TEST AND THE EXISTENCE OF PSEUDOPRIMES
Abstract
In this paper the author present Fermat test as one of primality tests. In order to perform the ability of the test, the algorithm of the test coded in Mathematica (6.0 version). The application of Fermat’s Little Theorem as well as Euler’s Theorem on the tests are also discussed and this leads to the concept of pseudoprime.
Downloads
References
Bektas, Attila.(2005). Probabilistic Primality Test. Master's Thesis. The Middle East Technical University.
Eynden, Charles Vanden.(2001). Elementary number theory.2nd edn. Illnois : McGraw-Hill
Gradini, Ega. 2009. Primality Testing. Project report of MSc in Teaching of Mathematics, Universiti Sains Malaysia.
Jones,Gareth A &Jones, Mary J. (1998). Elementary number theory.London:springer-Verlag
Kumanduri,Ramanujachary &Romero,cristina,(1998). Number Theory with computer Application. New Jersey: Prentice-Hall
McIntosh, Christina. (2007). finding Prime Numbers: Miller-Rabin and Beyond. Electronic Journal of Undergraduate Mathematics. [Online], 2007 (12). [Acessed 5th January 2009],Availabale from World Wide Web: www.scribd.com/doc/4904376/FINDING-PRIME-NUMBER -
Abstract views: 64
PDF downloads: 92
