In 2002, Agrawal, Kayal and Saxena, published an article presenting a deterministic, unconditional algorithm for primality testing in polynomial time. In this paper I have presented motivation for primality testing, discussed the theory behind the algorithm, and proved its correctness.
Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:umu-197288 |
Date | January 2022 |
Creators | Edrissi, Sara |
Publisher | Umeå universitet, Institutionen för matematik och matematisk statistik |
Source Sets | DiVA Archive at Upsalla University |
Language | English |
Detected Language | English |
Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
Format | application/pdf |
Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.1597 seconds