## A short course in discrete mathematicsWhat sort of mathematics do I need for computer science? In response, a pair of professors at the University of California at San Diego created this text. Explores Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, sequences, and series. Assumes some familiarity with calculus. Original 2005 edition. |

### What people are saying - Write a review

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

### Contents

Boolean Functions and Computer Arithmetic | 1 |

Logic | 27 |

Number Theory and Cryptography | 53 |

12 other sections not shown

### Other editions - View all

A Short Course in Discrete Mathematics S. Gill Williamson,Edward A. Bender No preview available - 2012 |

### Common terms and phrases

algebraic answer antisymmetric base bijection binary relation blocks Boolean functions Bucket called coimage common divisor contrapositive converges counterexample covering relation cycle decreasing subsequence define definition denoted digit diverges domain elements encryption equal equivalence relation Euclidean algorithm Example 16 false gcd(m give given harmonic series Hasse diagram inductive step infinite sequence infinite series integers lex order lexicographic order linear order logic multiple negation one-line notation one-to-one order relation P A Q pair partition perfect square permutation pigeonhole principle polynomial of degree poset positive integers prime factorization problem proof Prove by induction rational numbers real numbers reflexive remainder rule smallest specify statement form statement is true strings subsequence of length subsets Suppose symmetric Theorem topological sort transitive closure trapdoor function truth table two's complement Venn diagram write zero