In this thesis, I review the problem of primality testing. More specifically, I review the AKS algorithm and the theorems and problems leading up to the proof of this algorithm.
| Identifer | oai:union.ndltd.org:CLAREMONT/oai:scholarship.claremont.edu:scripps_theses-2026 |
| Date | 01 January 2017 |
| Creators | Siracusa, Mia |
| Publisher | Scholarship @ Claremont |
| Source Sets | Claremont Colleges |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Scripps Senior Theses |
| Rights | © 2017 Mia Siracusa |
Page generated in 0.0015 seconds