Primality Testing for Beginners
Lasse Rempe-Gillen Rebecca Waldecker
Primality Testing for Beginners - 1st ed. - Hyderabad American Mathematical Society 2017 - xii, 244p.
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.
English
9781470438425 1299.3
Number Theory
512.7 GIL
Primality Testing for Beginners - 1st ed. - Hyderabad American Mathematical Society 2017 - xii, 244p.
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.
English
9781470438425 1299.3
Number Theory
512.7 GIL