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.

Identiferoai:union.ndltd.org:UPSALLA1/oai:DiVA.org:umu-197288
Date January 2022
CreatorsEdrissi, Sara
PublisherUmeå universitet, Institutionen för matematik och matematisk statistik
Source SetsDiVA Archive at Upsalla University
LanguageEnglish
Detected LanguageEnglish
TypeStudent thesis, info:eu-repo/semantics/bachelorThesis, text
Formatapplication/pdf
Rightsinfo:eu-repo/semantics/openAccess

Page generated in 0.0023 seconds