Rempe-Gillen and Waldecker present this primer on prime numbers and their detection, framing the discussion with the usefulness of prime numbers in computing and encryption. Accordingly, chapter 1 discusses the foundational concepts and simple propositions regarding prime numbers, while chapter 2 discusses algorithms. The text then goes on to treat number theory, cryptography, and finally focuses on the AKS algorithm, discussing as a matter of course Fermat?s theorem, the Agrawal-Biswas test, and finally the theorem of Agrawal, Kayal, and Saxena. Although written in the language of formal logic including proofs of theorems, the book is written at a level intended to be accessible to high school students, and gives some space to gently introducing the concept and method of proofs. Annotation ©2014 Ringgold, Inc., Portland, OR (protoview.com)
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
EUR 17,01 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiEUR 11,49 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiDa: Revaluation Books, Exeter, Regno Unito
Paperback. Condizione: Brand New. 248 pages. 8.75x6.00x0.50 inches. In Stock. Codice articolo __0821898833
Quantità: 1 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: New. Translation of: Primzahltests f'ur Einsteiger: Zahlentheorie - Algorithmik - Kryptographie. Series: Student Mathematical Library. Num Pages: 248 pages. BIC Classification: PBH; PBW. Category: (G) General (US: Trade). Dimension: 217 x 145 x 14. Weight in Grams: 300. . 2013. Paperback. . . . . Codice articolo V9780821898833
Quantità: 1 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo FW-9780821898833
Quantità: 2 disponibili
Da: Rarewaves.com UK, London, Regno Unito
Paperback. Condizione: New. 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. Codice articolo LU-9780821898833
Quantità: 1 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 20708486
Quantità: 2 disponibili
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Paperback. Condizione: New. 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. Codice articolo LU-9780821898833
Quantità: 1 disponibili
Da: Kennys Bookstore, Olney, MD, U.S.A.
Condizione: New. Translation of: Primzahltests f'ur Einsteiger: Zahlentheorie - Algorithmik - Kryptographie. Series: Student Mathematical Library. Num Pages: 248 pages. BIC Classification: PBH; PBW. Category: (G) General (US: Trade). Dimension: 217 x 145 x 14. Weight in Grams: 300. . 2013. Paperback. . . . . Books ship from the US and Ireland. Codice articolo V9780821898833
Quantità: 1 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 20708486-n
Quantità: 2 disponibili
Da: moluna, Greven, Germania
Condizione: New. In 2002, Agrawal, Kayal, and Saxena answered a long-standing open question by presenting a deterministic test (the AKS algorithm) with polynomial running time that checks whether a number is prime or not. Rempe-Gillen and Waldecker introduce the aspects of . Codice articolo 972081891
Quantità: 2 disponibili
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Paperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days. 339. Codice articolo B9780821898833
Quantità: 2 disponibili