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)