Library - International Centre for Theoretical Sciences catalog › Details for: Primality testing for beginners

Normal view MARC view ISBD view

Primality testing for beginners

By: Lasse Rempe-GillenContributor(s): Rebecca WaldeckerMaterial type: Text

TextSeries: Student Mathematical Library ; Vol. 70Publication details: Rhode Island: American Mathematical Science, [c2015]Description: 244 pISBN: 978-0-8218-9883-3Subject(s): MathematicsLOC classification: QA241

Contents:

Introduction Part 1. Foundations Chapter 1. Natural numbers and primes Chapter 2. Algorithms and complexity Chapter 3. Foundations of number theory Chapter 4. Prime numbers and cryptography The AKS algorithm Chapter 5. The starting point: Fermat for polynomials Chapter 6. The theorem for Agrawal, Kayal, and Saxena Chapter 7. The algorithm

Summary: 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. --- Summary provided by publisher

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 2 )
Comments ( 0 )

Item type	Current library	Collection	Shelving location	Call number	Status	Notes	Date due	Barcode	Item holds
Book	ICTS	Mathematic	Rack No 4	QA241 (Browse shelf (Opens below))	Available	Billno:IN 003 582; Billdate: 2018-01-11		00966

Total holds: 0

Browsing ICTS shelves, Shelving location: Rack No 4 Close shelf browser (Hides shelf browser)

Previous								Next
Previous	QA241 A course in analytic number theory	QA241 Analytic number theory :exploring the anatomy of integers	QA241 p-adic analysis compared with real	QA241 Primality testing for beginners	QA241 Number theory : Proceedings of international conference held at The Institute of Mathematical Sciences, Chennai, January 2002	QA241 Number theory and discrete geometry : proceedings of the international conference on number theory and discrete geometry held in honour of Prof. R. P. Bambah ( Nov 30 - Dec 3, 2005)	QA241 Number theory : proceedings in honor of Prof. T.C. Vasudevan on his sixtieth birthday	Next

Introduction
Part 1. Foundations
Chapter 1. Natural numbers and primes
Chapter 2. Algorithms and complexity
Chapter 3. Foundations of number theory
Chapter 4. Prime numbers and cryptography
The AKS algorithm
Chapter 5. The starting point: Fermat for polynomials
Chapter 6. The theorem for Agrawal, Kayal, and Saxena
Chapter 7. The algorithm

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. --- Summary provided by publisher

There are no comments on this title.

to post a comment.