Description
Book SynopsisThis introductory book emphasizes algorithms and applications, and is accessible to a broad audience. The author alternates between theory and applications in order to illustrate the mathematics. This second edition includes many new exercises and worked examples, and has been reorganized to improve presentation and clarity of exposition.
Trade Review'The subject matter is presented in a very thorough way … The material is very well organized: definitions, results and their interrelations fit together perfectly … The book is especially attractive to students with a background or interest in computer science … The suitability of the book for self-study is greatly enhanced by a wealth of exercises and examples that are provided … the book is very well-written, and it is a pleasure to read.' Mathematics of Computation
'… the book could serve as a course of discrete mathematics for computer science students.' EMS Newsletter
Table of ContentsPreface; Preliminaries; 1. Basic properties of the integers; 2. Congruences; 3. Computing with large integers; 4. Euclid's algorithm; 5. The distribution of primes; 6. Abelian groups; 7. Rings; 8. Finite and discrete probability distributions; 9. Probabilistic algorithms; 10. Probabilistic primality testing; 11. Finding generators and discrete logarithms in Z*p; 12. Quadratic reciprocity and computing modular square roots; 13. Modules and vector spaces; 14. Matrices; 15. Subexponential-time discrete logarithms and factoring; 16. More rings; 17. Polynomial arithmetic and applications; 18. Linearly generated sequences and applications; 19. Finite fields; 20. Algorithms for finite fields; 21. Deterministic primality testing; Appendix: some useful facts; Bibliography; Index of notation; Index.
