Primality Testing for Beginners

· Student Mathematical Library ຫົວທີ 70 · American Mathematical Soc.
ປຶ້ມອີບຸກ
240
ໜ້າ
ບໍ່ໄດ້ຢັ້ງຢືນການຈັດອັນດັບ ແລະ ຄຳຕິຊົມ ສຶກສາເພີ່ມເຕີມ

ກ່ຽວກັບປຶ້ມ e-book ນີ້

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.

ໃຫ້ຄະແນນ e-book ນີ້

ບອກພວກເຮົາວ່າທ່ານຄິດແນວໃດ.

ອ່ານ​ຂໍ້​ມູນ​ຂ່າວ​ສານ

ສະມາດໂຟນ ແລະ ແທັບເລັດ
ຕິດຕັ້ງ ແອັບ Google Play Books ສຳລັບ Android ແລະ iPad/iPhone. ມັນຊິ້ງຂໍ້ມູນໂດຍອັດຕະໂນມັດກັບບັນຊີຂອງທ່ານ ແລະ ອະນຸຍາດໃຫ້ທ່ານອ່ານທາງອອນລາຍ ຫຼື ແບບອອບລາຍໄດ້ ບໍ່ວ່າທ່ານຈະຢູ່ໃສ.
ແລັບທັອບ ແລະ ຄອມພິວເຕີ
ທ່ານສາມາດຟັງປຶ້ມສຽງທີ່ຊື້ໃນ Google Play ໂດຍໃຊ້ໂປຣແກຣມທ່ອງເວັບຂອງຄອມພິວເຕີຂອງທ່ານໄດ້.
eReaders ແລະອຸປະກອນອື່ນໆ
ເພື່ອອ່ານໃນອຸປະກອນ e-ink ເຊັ່ນ: Kobo eReader, ທ່ານຈຳເປັນຕ້ອງດາວໂຫຼດໄຟລ໌ ແລະ ໂອນຍ້າຍມັນໄປໃສ່ອຸປະກອນຂອງທ່ານກ່ອນ. ປະຕິບັດຕາມຄຳແນະນຳລະອຽດຂອງ ສູນຊ່ວຍເຫຼືອ ເພື່ອໂອນຍ້າຍໄຟລ໌ໄໃສ່ eReader ທີ່ຮອງຮັບ.