Return to search

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, 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).

Identiferoai:union.ndltd.org:fsu.edu/oai:fsu.digital.flvc.org:fsu_257182
ContributorsSaliba, Michael S. (authoraut), McCarthy, Paul J. (professor directing thesis.), Florida State University (degree granting institution)
PublisherFlorida State University, Florida State University
Source SetsFlorida State University
LanguageEnglish, English
Detected LanguageEnglish
TypeText, text
Format1 online resource (iii, 28 leaves), computer, application/pdf
RightsThis Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). The copyright in theses and dissertations completed at Florida State University is held by the students who author them.

Page generated in 0.0015 seconds