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.

為這本電子書評分

歡迎提供意見。

閱讀資訊

智慧型手機與平板電腦
只要安裝 Google Play 圖書應用程式 Android 版iPad/iPhone 版,不僅應用程式內容會自動與你的帳戶保持同步,還能讓你隨時隨地上網或離線閱讀。
筆記型電腦和電腦
你可以使用電腦的網路瀏覽器聆聽你在 Google Play 購買的有聲書。
電子書閱讀器與其他裝置
如要在 Kobo 電子閱讀器這類電子書裝置上閱覽書籍,必須將檔案下載並傳輸到該裝置上。請按照說明中心的詳細操作說明,將檔案傳輸到支援的電子閱讀器上。