Logo - springer
Slogan - springer

Mathematics - Number Theory and Discrete Mathematics | Discrete Mathematics

Discrete Mathematics

Series: Universitext

Gallier, Jean

2011, XIII, 465p. 220 illus., 20 illus. in color.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-1-4419-8047-2

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-1-4419-8046-5

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

  • 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

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.


Content Level » Lower undergraduate

Keywords » combinatorics - graphs - logic - proofs - public key cryptography

Related subjects » Applications - Image Processing - Mechanical Engineering - Number Theory and Discrete Mathematics

Table of contents / Sample pages 

Mathematical Reasoning, Proof Principles and Logic.- Relations, Functions, Partial Functions.- Graphs, Part I: Basic Notions.-  Some Counting Problems; Multinomial Coefficients.- Partial Orders, GCD's, RSA, Lattices.- Graphs, Part II: More Advanced Notions.- Answers to Selected Problems.

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Number Theory.