| 书目名称 | Discrete Mathematics | | 编辑 | Jean Gallier | | 视频video | | | 概述 | Summarizing the rules of mathematical reasoning and how to construct proofs.Presents examples of formal and informal proofs.Includes examples of proofs by induction.Discusses public key cryptography, | | 丛书名称 | Universitext | | 图书封面 |  | | 描述 | 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. | | 出版日期 | Textbook 2011 | | 关键词 | combinatorics; graphs; logic; proofs; public key cryptography | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4419-8047-2 | | isbn_softcover | 978-1-4419-8046-5 | | isbn_ebook | 978-1-4419-8047-2Series ISSN 0172-5939 Series E-ISSN 2191-6675 | | issn_series | 0172-5939 | | copyright | Springer Science+Business Media, LLC 2011 |
The information of publication is updating
|
|
发表于 2025-3-21 19:32:59
