Description: The course covers mathematics useful in analyzing computer algorithms. Topics include recurrence relations; evaluation of sums; integer functions; elementary number theory; binomial ...

Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...