Discrete Mathematics

Jean Gallier

ISBN 10: 1441980466 / ISBN 13: 9781441980465

Published by Springer New York, Springer US Jan 2011, 2011

About this Item

Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 480 pp. Englisch.

Seller Inventory # 9781441980465

Bibliographic Details

• Title: Discrete Mathematics
• Publisher: Springer New York, Springer US Jan 2011
• Publication Date: 2011
• Language: English
• ISBN 10: 1441980466
• ISBN 13: 9781441980465
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 26D millimeters 235 millimeters width by 155 millimeters height by 26 millimeters depth
• Weight: 721 grams

About this title

Synopsis

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.

About the Author

Jean Gallier is a Professor in the Computer and Information Science Department, School of Engineering and Applied Science at the University of Pennsylvania.