### MA2060 Discrete Mathematics

#### Course Details

**Basics:**

Sets, set operations, cardinality of sets, relations, equivalence relations and equivalence classes.

**Number theory:**

Divisibility and modular arithmetic, integer representations, primes and gcd, solving congruences and applications, cryptography.

**Counting:**

Basic counting, pigeon hole principle, permutations and combinations, Binomial coefficients, generalized permutations and combinations.

**Advanced counting techniques:**

Applications of recurrence relations, solution of recurrence relations, divide and conquer algorithms, generating functions, Inclusion-exclusion and applications.

#### Course References:

TEXT:

K.H. Rosen, Discrete Mathematics and its Applications, 7th Ed., McGraw Hill, 2012.

REFERENCES:

1. S.S. Epp, Discrete Mathematics with Applications, 4th Ed., Cengage Learning, 2011.

2. R.P. Grimaldi, Discrete And Combinatorial Mathematics, 5th Ed., Pearson, 2004.

3. T. Koshy, Discrete Mathematics with Applications, Elsevier, 2004.

4. J.L. Mott, A. Kandel and T.P. Baker, Discrete Mathematics for Computer Scientists& Mathematicians, 2nd Ed., PHI Learning, 1986.