Parameters
- 846 pages
- 30 hours of reading
More about the book
Taking an approach suitable for a broad readership, this text provides a rigorous yet accessible exposition of discrete mathematics, which forms the core mathematical foundation of computer science. The comprehensive approach maintains an easy-to-follow progression from basic ideas to more sophisticated concepts. This edition preserves the philosophy of its predecessors while updating some content. The expanded first chapter introduces a new section on the formal proof of argument validity in propositional logic before transitioning to predicate logic. Additionally, a new chapter on elementary number theory and congruences explores groups in modular arithmetic and RSA encryption, a widely used public key encryption scheme that ensures secure data encryption. This edition also includes a detailed solutions manual for qualifying instructors. By exploring the relationship between mathematics and computer science, the text continues to provide a solid grounding in the theory of discrete mathematics while augmenting the theoretical foundation with relevant applications. It is designed to help readers develop the rigorous logical thinking necessary to adapt to the evolving demands of computer science.
Book purchase
Discrete Mathematics, Rowan Garnier, John Taylor
- Language
- Released
- 2009
- product-detail.submit-box.info.binding
- (Hardcover)
Payment methods
We’re missing your review here.
- Title
- Discrete Mathematics
- Subtitle
- Proofs, Structures and Applications, Third Edition
- Language
- English
- Authors
- Rowan Garnier, John Taylor
- Publisher
- CRC Press
- Released
- 2009
- Format
- Hardcover
- Pages
- 846
- ISBN10
- 1439812802
- ISBN13
- 9781439812808
- Series
- Tags
- Non-Fiction, Technology & Engineering, Science & Math, Natural sciences, Computers & Internet, Science, USA, Mathematics, Physics, Professional Literature, Logic, Operating Systems, Combinatorics
- Rating
- 4 out of 5
- Description
- Taking an approach suitable for a broad readership, this text provides a rigorous yet accessible exposition of discrete mathematics, which forms the core mathematical foundation of computer science. The comprehensive approach maintains an easy-to-follow progression from basic ideas to more sophisticated concepts. This edition preserves the philosophy of its predecessors while updating some content. The expanded first chapter introduces a new section on the formal proof of argument validity in propositional logic before transitioning to predicate logic. Additionally, a new chapter on elementary number theory and congruences explores groups in modular arithmetic and RSA encryption, a widely used public key encryption scheme that ensures secure data encryption. This edition also includes a detailed solutions manual for qualifying instructors. By exploring the relationship between mathematics and computer science, the text continues to provide a solid grounding in the theory of discrete mathematics while augmenting the theoretical foundation with relevant applications. It is designed to help readers develop the rigorous logical thinking necessary to adapt to the evolving demands of computer science.