Date of Award:

5-1983

Document Type:

Thesis

Degree Name:

Master of Science (MS)

Department:

Mathematics and Statistics

Department name when degree awarded

Mathematics

Advisor/Chair:

Lawrence O. Cannon

Abstract

This paper gives a survey of different methods of prime number testing. Emphasis has been given to algorithms based upon Fermat's Theorem: if p is an odd prime number, then p divides ap-a. All of the computer programs described in this paper have been written for use on microcomputers and so the feasibility of using microcomputers is also discussed. Finally, numbers of various forms have been considered for primality with special attention given to Mersenne and Fermat numbers. It is hoped that some of the information contained in this paper may provide worthwhile enrichment ideas for mathematics educators.

Checksum

ce9ffa2965d5b0caf6abdbe83b52be7c

Included in

Mathematics Commons

Share

COinS