Discrete Mathematics

  • Jean Gallier

Part of the Universitext book series (UTX)

About this book

Introduction

This book gives an introduction to discrete mathematics for beginning undergraduates and starts with a chapter on the rules of mathematical reasoning.

 

This book  begins with a presentation of the rules of logic as used in mathematics where 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 deals with functions and relations, directed and undirected graphs and an introduction to combinatorics, partial orders and complete induction. 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 where Eulerian and Hamiltonian cycles are discussed. This book also includes network flows, matchings, covering, bipartite graphs, planar graphs and state the graph minor theorem of Seymour and Robertson.

 

The book is highly illustrated  and each chapter ends with a list of problems of varying difficulty. Undergraduates in mathematics and computer science will find this book useful.

 

Keywords

combinatorics graphs logic proofs public key cryptography

Authors and affiliations

  • Jean Gallier
    • 1
  1. 1., Computer and Information ScienceUniversity of PennsylvaniaPhiladelphiaUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4419-8047-2
  • Copyright Information Springer Science+Business Media, LLC 2011
  • Publisher Name Springer, New York, NY
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-1-4419-8046-5
  • Online ISBN 978-1-4419-8047-2
  • About this book