Download WordPress Themes, Happy Birthday Wishes
Home » Mathematics » Discrete Mathematics for Computer Science

Discrete Mathematics for Computer Science

  • Category: Mathematics
  • Author: Jean H. Gallier
  • Pages: 477 pages
  • File type: PDF, PostScript, and other formats

Read and download free eBook intituled Discrete Mathematics for Computer Science in format PDF, PostScript, and other formats – 477 pages created by Jean H. Gallier.

This book 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.

Read and Download Links:

Discrete Mathematics for Computer Science

READ  Curves and Surfaces in Geometric Modeling: Theory & Algorithms

Leave a Reply

Your email address will not be published. Required fields are marked *

*

x

Check Also

Abstract Algebra A Study Guide for Beginners 2nd Edition

Read and download free Book intituled Abstract Algebra A Study Guide for Beginners 2nd Edition in format PDF written by John A. Beach.