Primality Testing for Beginners

· Student Mathematical Library 第 70 本图书 · American Mathematical Soc.
电子书
240
评分和评价未经验证  了解详情

关于此电子书

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.

为此电子书评分

欢迎向我们提供反馈意见。

如何阅读

智能手机和平板电脑
只要安装 AndroidiPad/iPhone 版的 Google Play 图书应用,不仅应用内容会自动与您的账号同步,还能让您随时随地在线或离线阅览图书。
笔记本电脑和台式机
您可以使用计算机的网络浏览器聆听您在 Google Play 购买的有声读物。
电子阅读器和其他设备
如果要在 Kobo 电子阅读器等电子墨水屏设备上阅读,您需要下载一个文件,并将其传输到相应设备上。若要将文件传输到受支持的电子阅读器上,请按帮助中心内的详细说明操作。