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.
With our dedicated customer support team, 30-day no-questions-asked return policy, and our price match guarantee, you can rest easy knowing that we're doing everything we can to save you time, money, and stress.
Book condition guidelines
New (perfect condition)
Pages are clean and are not marked by notes, highlighting or fold.
Like new (excellent condition)
Pages are clean and are not marked by notes, highlighting or folds.
Very good (good condition)
Pages are intact and may have minimal notes and/or highlighting or folds.
Good (clean condition)
All pages and the cover is intact. The spine may show signs of wear. Pages include notes and/or highlighting.
Acceptable (readable condition)
All pages and the cover is intact. Pages include considerable notes in pen or highlighter, but the text is not obscured.
How do rentals work?
Save up to 90% on the largest selection of textbook rentals in the business. We have the lowest prices - guaranteed.
Choose between standard or expedited shipping to make sure that your textbooks arrive in time for class.
Return for free!
When your books are due, just pack them up and ship them back. And don't worry about shipping - it's absolutely free!