Presents propositional logic, combinatorics, methods of proof, mathematical systems, algebra of sets, matrix algebra, relations and functions, recursion and generating functions, applications to ...

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 ...

Examines graph theory, trees, algebraic systems, Boolean algebra, groups, monoids, automata, machines, rings and fields, applications to coding theory, logic design ...

The course covers fundamental ideas from discrete mathematics, especially for computer science students. It focuses on topics that will be foundational for future courses including algorithms, ...

the study of structures and relations in sets; and abstract algebra and design theory, the study of symmetries. It is a good field for someone who sees the beauty in mathematics. Degree requirements ...

Sets, logic, mathematical induction, functions and equivalence relations. Partial orderings, algebraic structures and morphisms. Error correcting codes and public key ...