Bookbot

Discrete Mathematics

Proofs, Structures and Applications, Third Edition

Ocena książki

Więcej o książce

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.

Zakup książki

Discrete Mathematics, Rowan Garnier, John Taylor

Język
Rok wydania
2009
Oprawa
(twarda)
Jak tylko się pojawi, wyślemy Ci wiadomość e-mail.

Metody płatności

4,0
Bardzo dobra
2 Ocena

Brakuje nam tutaj Twojej recenzji.

Tytuł
Discrete Mathematics
Podtytuł
Proofs, Structures and Applications, Third Edition
Język
angielski
Wydawca
CRC Press
Rok wydania
2009
Oprawa
twarda
Liczba stron
846
ISBN10
1439812802
ISBN13
9781439812808
Seria
Ocena
4 z 5
Opis
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.