Review2 of Number Theory for Computing Author of Book: Song Y. Yan Publisher: Springer (381 pages) Author of Review: Prodromos Saridis Overview The theory of numbers, in mathematics, is primarily the theory of the properties of integers. The subject has long been considered as the purest branch of mathematics, with very few applications to other areas. However recent years have seen considerable increase in interest in several central topics of number theory, precisely because of their importance and applications in other areas, particularly in computing and information technology. This book takes the reader from elementary number theory in computer science, via algorithmic number theory, to applied number theory in computer science. The book follows the style De nition Theorem Algorithm Example rather than the De nition Theorem Proof style. For a reader who has at least high-school math background the derivations in the book will not be dif cult to follow. Summary of Contents The book is divided into three parts, each consisting of multiple chapters. 2.1 Part I. Elementary Number Theory ( Introduction / Theory of Divisibility / Diophantine Equations / Arithmetic Functions / Distribution of Prime Numbers / Theory of Congruences / Arithmetic of
/lp/association-for-computing-machinery/review-of-number-theory-for-computing-wHtPaxlQ01