The converse of Fermat's theorem
"Of considerable interest among mathematicians is the problem of the determination of primality of positive integers. For a small integer, N, we may say that N is prime or composite merely by trying to divide N by all primes less than or equal to the square root of N since if N is composite, on...
| Other Authors: | |
|---|---|
| Format: | Others |
| Language: | English English |
| Published: |
Florida State University
|
| Subjects: | |
| Online Access: | http://purl.flvc.org/fsu/fd/FSU_historic_AKP4926 |
| Summary: | "Of considerable interest among mathematicians is the problem of the determination of primality of positive integers. For a small integer, N, we may say that N is prime or composite merely by trying to divide N by all primes less than or equal to the square root of N since if N is composite, one of its factors must be [less than or equal to] the square root of N. However, if N is large this test loses its practicality and we must resort to a more feasible method. It is the purpose of this paper to trace and show the development of such methods"--Introduction. === "June, 1959." === Typescript. === "Submitted to the Graduate Council of Florida State University in partial fulfillment of the requirements for the degree of Master of Science." === Advisor: Paul J. McCarthy, Professor Directing Paper. === Includes bibliographical references (leaf 28). |
|---|