"Chinese Remainder Theorem," CRT, is one of the jewels of mathematics. It is a perfect combination of beauty and utility or, in the words of Horace, "omne tulit punctum qui miscuit utile dulci." Known already for ages, CRT continues to present itself in new contexts and open vistas for new types of applications. So far, its usefulness has been obvious within the realm of “three C's”. "Computing" was its original field of application, and continues to be important as regards various aspects of algorithmics and modular computations. Theory of codes and cryptography are two more recent fields of application.This book tells about CRT, its background and philosophy, history, generalizations and, most importantly, its applications. The book is self-contained. This means that no factual knowledge is assumed on the part of the reader. We even provide brief tutorials on relevant subjects, algebra and information theory. However, some mathematical maturity is surely a prerequisite, as our presentation is at an advanced undergraduate or beginning graduate level. We have tried to make the exposition innovative, many of the individual results being new. We will return to this matter, as well as to the interdependence of the various parts of the book, at the end of the Introduction.A special course about CRT can be based on the book. The individual chapters are largely independent and, consequently, the book can be used as supplementary material for courses in algorithmics, coding theory, cryptography or theory of computing. Of course, the book is also a reference for matters dealing with CRT.Contents: Introduction and PhilosophyChinese Remainder AlgorithmIn Modular ComputationsIn AlgorithmicsIn Bridging ComputationsIn Coding TheoryIn CryptographyTutorial in Information TheoryTutorial in AlgebraList of Mathematical SymbolsBibliographyReadership: Postgraduate students, researchers and scientists of theoretical foundations of computer science, numerical and computational methods.