Primality Testing for Beginners

· Student Mathematical Library Book 70 · American Mathematical Soc.
Ebook
240
Pages
Ratings and reviews aren’t verified  Learn More

About this ebook

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.

Rempe-Gillen and
Waldecker introduce the aspects of number theory, algorithm theory, and
cryptography that are relevant for the AKS algorithm and explain in
detail why and how this test works. This book is specifically designed
to make the reader familiar with the background that is necessary to
appreciate the AKS algorithm and begins at a level that is suitable for
secondary school students, teachers, and interested amateurs.
Throughout the book, the reader becomes involved in the topic by means
of numerous exercises.

Rate this ebook

Tell us what you think.

Reading information

Smartphones and tablets
Install the Google Play Books app for Android and iPad/iPhone. It syncs automatically with your account and allows you to read online or offline wherever you are.
Laptops and computers
You can listen to audiobooks purchased on Google Play using your computer's web browser.
eReaders and other devices
To read on e-ink devices like Kobo eReaders, you'll need to download a file and transfer it to your device. Follow the detailed Help Center instructions to transfer the files to supported eReaders.