- We will send in 10–14 business days.
/images/books/9868530/9781441980465.jpg)
- Author: Jean Gallier
- Publisher: Springer
- Year: 2011
- Pages: 482
- ISBN-10: 1441980466
- ISBN-13: 9781441980465
- Format: 15.5 x 22.9 x 2.8 cm, softcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
This books gives an introduction to discrete mathematics for beginning undergraduates. One of original features of this book is that it begins with a presentation of the rules of logic as used in mathematics. Many examples of formal and informal proofs are given. With this logical framework firmly in place, the book describes the major axioms of set theory and introduces the natural numbers. The rest of the book is more standard. It deals with functions and relations, directed and undirected graphs, and an introduction to combinatorics. There is a section on public key cryptography and RSA, with complete proofs of Fermat's little theorem and the correctness of the RSA scheme, as well as explicit algorithms to perform modular arithmetic. The last chapter provides more graph theory. Eulerian and Hamiltonian cycles are discussed. Then, we study flows and tensions and state and prove the max flow min-cut theorem. We also discuss matchings, covering, bipartite graphs.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 20d.18:03:49
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Jean Gallier
- Publisher: Springer
- Year: 2011
- Pages: 482
- ISBN-10: 1441980466
- ISBN-13: 9781441980465
- Format: 15.5 x 22.9 x 2.8 cm, softcover
- Language: English English
This books gives an introduction to discrete mathematics for beginning undergraduates. One of original features of this book is that it begins with a presentation of the rules of logic as used in mathematics. Many examples of formal and informal proofs are given. With this logical framework firmly in place, the book describes the major axioms of set theory and introduces the natural numbers. The rest of the book is more standard. It deals with functions and relations, directed and undirected graphs, and an introduction to combinatorics. There is a section on public key cryptography and RSA, with complete proofs of Fermat's little theorem and the correctness of the RSA scheme, as well as explicit algorithms to perform modular arithmetic. The last chapter provides more graph theory. Eulerian and Hamiltonian cycles are discussed. Then, we study flows and tensions and state and prove the max flow min-cut theorem. We also discuss matchings, covering, bipartite graphs.
Reviews