Back to search

Hosted by Utah State University Libraries

Microcomputer Algorithms for Prime Number Testing

Abstract

dc:description.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.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematics and Statistics
Grantor dc:publisher
Hosted by Utah State University Libraries

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Barton, Susan Dale
Contributors dc:contributor
  • Lawrence O. Cannon

Subjects

dc:subject × 1

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Utah State University
Base URL
digitalcommons.usu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Barton, Susan Dale. Microcomputer Algorithms for Prime Number Testing. Thesis thesis, Hosted by Utah State University Libraries, https://digitalcommons.usu.edu/etd/6975