Table of contents for Discrete mathematics with algorithms / Michael O. Albertson, Joan P. Hutchinson.


Bibliographic record and links to related information available from the Library of Congress catalog


Information from electronic data provided by the publisher. May be incomplete or contain other coding.


Counter
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 Oh'' 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.


Library of Congress subject headings for this publication: Mathematics, Computer science Mathematics