Discrete and Combinatorial Mathematics: An Applied Introduction
This fifth edition continues to improve on the features that have made it the market leader. The text offers a flexible organization, enabling instructors to adapt the book to their particular courses. The book is both complete and careful, and it continues to maintain its emphasis on algorithms and applications. Excellent exercise sets allow students to perfect skills as they practice. This new edition continues to feature numerous computer science applications-making this the ideal text for preparing students for advanced study.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Fundamentals of Logic
Relations and Functions
15 other sections not shown
Other editions - View all
addition algorithm apply binary operation Boolean algebra called Chapter coefficient colors column Consequently consider contains count the number countable defined Definition denote determine diagram distinct divisors edges elements equation equivalence relation EXAMPLE Exercise Figure finite state machine four function gcd(a given graph G Hamilton cycle Hasse diagram Hence input integer integral domain inverse isomorphic label Latin squares Let G loop-free Mathematical Induction matrix multiplication n e Z+ one-to-one palindromes partial order partition path permutations polynomial poset positive integer Pr(A Pr(B Pr(X primitive statements Principle of Mathematical problem proof prove random variable real numbers recurrence relation result ring root sample space Section sequence shown in Fig solution spanning tree step strings subgraph subset summand Table Theorem theory true truth value undirected graph vertex vertices write wxyz