Computational methods in number theory
| dc.creator | Shih, Cheng Shyan | |
| dc.date.accessioned | 2022-02-03T17:17:28Z | |
| dc.date.available | 2022-02-03T17:17:28Z | |
| dc.date.issued | 1971 | |
| dc.description.abstract | This paper presents a number of methods for testing the primality of any given number N. A brief history of number theory is introduced in Chapter I. The main task of this paper is to test the primality of any given number. However, if the test shows a negative result, or that the given number is not a prime but a composite, then the task is extended to the next step - factoring the given number. Several methods for factorization of a given number N are discussed in Chapter III. In addition, a representive example for both tasks as carried out by a computer program written in the Fortran IV language is presented. | |
| dc.description.department | Computer Science, Department of | |
| dc.format.digitalOrigin | reformatted digital | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.other | 13673612 | |
| dc.identifier.uri | https://hdl.handle.net/10657/8652 | |
| dc.language.iso | en | |
| dc.rights | This item is protected by copyright but is made available here under a claim of fair use (17 U.S.C. §107) for non-profit research and educational purposes. Users of this work assume the responsibility for determining copyright status prior to reusing, publishing, or reproducing this item for purposes other than what is allowed by fair use or other copyright exemptions. Any reuse of this item in excess of fair use or other copyright exemptions requires express permission of the copyright holder. | |
| dc.title | Computational methods in number theory | |
| dc.type.dcmi | Text | |
| dc.type.genre | Thesis | |
| thesis.degree.department | Computer Science, Department of | |
| thesis.degree.discipline | Computer Science | |
| thesis.degree.grantor | University of Houston | |
| thesis.degree.level | Masters | |
| thesis.degree.name | Master of Science |
Files
Original bundle
1 - 1 of 1