Date of Award:
5-1983
Document Type:
Thesis
Degree Name:
Master of Science (MS)
Department:
Mathematics and Statistics
Department name when degree awarded
Mathematics
Committee Chair(s)
Lawrence O. Cannon
Committee
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
30f502370310ee2f0151dfb004ff982c
Recommended Citation
Barton, Susan Dale, "Microcomputer Algorithms for Prime Number Testing" (1983). All Graduate Theses and Dissertations, Spring 1920 to Summer 2023. 6975.
https://digitalcommons.usu.edu/etd/6975
Included in
Copyright for this work is retained by the student. If you have any questions regarding the inclusion of this work in the Digital Commons, please email us at .