I'm taking my first discrete math course. One aspect of functions has me stumped. We're asked to list the functions from a two-element set to a three-element set. And then list all the functions ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...

An introduction to discrete mathematics, including combinatorics and graph theory. The necessary background tools in set theory, logic, recursion, relations, and functions are also included. Masters ...

Introduces students to ideas and techniques from discrete mathematics that are widely used in science ... algorithms, growth of functions and complexity; integer congruences; basic and advanced ...

This is a course covering a number of concepts and techniques of discrete mathematics. Topics covered: Counting: selections; inclusion-exclusion; generating functions; recurrence relations. Graph ...

This book can be used as a textbook for the Discrete Mathematics course which is typically offered ... The book is organized into six chapters, one each on Logic; Functions & Relations; Combinatorics; ...

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