Skip to content
← Back to courses
MA5L003 Masters (Mathematics) · Generally offered: Autumn

Discrete Mathematics

L 3 T 1 P 0 Credits 4 Hours 4
Set theory: sets, relations, functions, countability; Logic: formulae, interpretations, methods of proof, soundness and completeness in propositional and predicate logic; Number theory: division algorithm, Euclid's algorithm, fundamental theorem of arithmetic, Chinese remainder theorem, special numbers like Catalan, Fibonacci, harmonic and Stirling; Combinatorics: permutations, combinations, pigeonhole principle, inclusion and exclusion principle, partitions, recurrence relations, generating functions; Graph Theory: paths, connectivity, subgraphs, isomorphism, trees, complete graphs, bipartite graphs, matchings, colourability, planarity, digraphs, Eulerian cycle and Hamiltonian cycle, adjacency and incidence matrices.
Full syllabus document →

1 question tagged to this course

0 Votes

Recursion and sequences

Find the general term of the sequence defined by $x_0 = 3, \, x_1 = 4$ and $$ x_{n+1} = x_{n-1}^2 - nx_n $$ for all $n\in\mathbb{N}$.