Discrete Mathematics With Algorithms

Partial table of contents: SETS AND ALGORITHMS: AN INTRODUCTION. Binary Arithmetic and the Magic Trick Revisited. Algorithms. Set Theory and the Magic Trick. Set Cardinality and Counting. ARITHMETIC. Exponentiation: A First Look. Three Inductive Proofs. How Good Is Fast Exponentiation? The ''Big Oh22 Notation. ARITHMETIC OF SETS. Binomial Coefficients. Permutations. The Binomial Theorem. NUMBER THEORY. Greatest Common Divisors. The Euclidean Algorithm. Fibonacci Numbers. Congruences and Equivalence Relations. An Application: Public Key Encryption Schemes. GRAPH THEORY. Building the LAN. Graphs. Trees and the LAN. Graphical Highlights. Index.Michael O. Albertson is the author of 'Discrete Mathematics With Algorithms', published 1988 under ISBN 9780471849025 and ISBN 0471849022.