## Introductory discrete structures with applications |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Sets and Sequences | 1 |

Z Methods of Counting | 24 |

Some Algebraic Tools | 42 |

Copyright | |

12 other sections not shown

### Common terms and phrases

A U B antisymmetric binary operation Boolean algebra Boolean expression Boolean matrix Boolean polynomial called CHAPTER TEST complement Consider constructed contains corresponding denoted described determine diagonal digit digraph disjoint equal equivalence relation event everywhere defined Example 1 Let EXERCISE SET false Figure Find finite set following relation formula function GCD(a given grammar graph Hasse diagram in-degree input integers irreflexive isomorphic Karnaugh map labeled lattice List the elements m x n mathematical induction maximal element monoid Moore machine multiplication number of elements odd permutations ordered pairs partial order partition path of length performed pigeonhole principle poset positive integer Proof properties prove real numbers recursive reflexive result REVIEW EXERCISES Section semigroup Show shown in Fig Solution statement string subsets subtree Suppose symbol symmetric relation syntax diagram THEORETICAL EXERCISES T1 tree true truth table upper bound vertex vertices write zero