Primality testing for beginners

Description:

""How can you tell whether a number is prime? What if the number has hundreds or thousands of digits? This question may seem abstract or irrelevant, but in fact, primality tests are performed every time we make a secure online transaction. In 2002, Agrawal, Kayal, and Saxena answered a long-standing open question in this context by presenting a deterministic test (the AKS algorithm) with polynomial running time that checks whether a number is prime or not. What is more, their methods are essentially elementary, providing us with a unique opportunity to give a complete explanation of a current mathematical breakthrough to a wide audience.""--Publisher's description.

subjects: Number theory,  Number theory -- Instructional exposition (textbooks, tutorial papers, etc.).,  Number theory -- Research exposition (monographs, survey articles),  Number theory -- Elementary number theory -- Elementary number theory,  Number theory -- Computational number theory -- Primality,  Number theory -- Computational number theory -- Algorithms; complexity,  Primzahltest,  Number theory -- Instructional exposition (textbooks, tutorial papers, etc.)