Overview
- 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, with a complete proof of the correctness of RSA Explicit, detailed algorithms for modular arithmetic
- Explores graph flows and the max-flow min-cut theorem
- Covers planar graphs
- Includes supplementary material: sn.pub/extras
Part of the book series: Universitext (UTX)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (6 chapters)
Keywords
About this book
Reviews
From the reviews:
“This well-written, highly illustrated book will be very useful and interesting to students in both mathematics and computer science. … Attractive features of this book include clear presentations, end-of-chapter summaries and references, a useful set of problems of varying difficulty, and a symbol as well as a subject index. Summing Up: Highly recommended. Upper-division undergraduates, graduate students, and professionals/practitioners.” (D. V. Chopra, Choice, Vol. 48 (11), July, 2011)
“This book is intended to be a textbook for students in Computer Science, covering basic areas of Discrete Mathematics. … lots of references to supplementary or more advanced literature are provided, and less basic and more sophisticated problems as well as connections to other areas of science are given. Each chapter closes with a rich collection of exercises, which often include hints to their solution and further explanations.” (Martina Kubitzke, Zentralblatt MATH, Vol. 1227, 2012)
“This book provides a rigorous introduction to standard topics in the field: logical reasoning, sets, functions, graphs and counting techniques. Its intended audience is computer science undergraduate students, but could also be used in a course for mathematics majors. … Each chapter has a summary and a generous number of exercises … . The exposition is structured as a series of propositions and theorems that are proved clearly and in detail. Historical remarks and an abundance of photographs of mathematicians enliven the text.” (Gabriella Pinter, The Mathematical Association of America, February, 2012)
Authors and Affiliations
About the author
Bibliographic Information
Book Title: Discrete Mathematics
Authors: Jean Gallier
Series Title: Universitext
DOI: https://doi.org/10.1007/978-1-4419-8047-2
Publisher: Springer New York, NY
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer Science+Business Media, LLC 2011
Softcover ISBN: 978-1-4419-8046-5Published: 25 January 2011
eBook ISBN: 978-1-4419-8047-2Published: 01 February 2011
Series ISSN: 0172-5939
Series E-ISSN: 2191-6675
Edition Number: 1
Number of Pages: XIV, 466
Number of Illustrations: 200 b/w illustrations, 20 illustrations in colour
Topics: Number Theory, Computer Imaging, Vision, Pattern Recognition and Graphics, Engineering Design, Applications of Mathematics