2T TOPICS IN DISCRETE MATHEMATICS

Class Head: The class head is Dr. Danny Stevenson Room 434 Mathematics Building e-mail: Danny.Stevenson@glasgow.ac.uk Oce Hours: Tuesday 15:00 16:30, Wednesday 15:00 16:30. General Information: See the information sheet General Information available on the Moodle Page Level 2 - General Information. You should familiarize yourself with the contents of this information sheet. Any signicant changes to the information contained therein will be announced in lectures, posted to Moodle and students will be notied by email. Therefore it is important that you regularly check your university email. Lectures and Tutorials: Lectures are held every Tuesday and Thursday 13:00 14:00 in Room 204 of the Mathematics Building. Students will attend one tutorial every second Monday. Students enrolled in Tutorial Group 1 will attend tutorials in even weeks, beginning on Monday January 16 (Week 18). Students enrolled in Tutorial Group 2 will attend tutorials in odd weeks, beginning on Monday January 23 (Week 19). All tutorials will be held on Mondays 13:00 14:00 in Room 204 of the Mathematics Building. Tutorials are an important place for you to receive feedback on your work in the course: therefore please make sure you prepare for tutorials and bring all relevant material including lecture notes. Aims: The main aim of the course is to introduce the basic ideas, examples and applications of discrete mathematics in the following areas: Graph Theory, Counting, Number Theory and Cryptography, Logic and Boolean Algebra. Textbooks: There is no required textbook for the course. You might like however to consult the following book which is available in the library: K. H. Rosen, Discrete Mathematics and its Applications Other books which you might nd useful, and are also in the library, include I. Anderson, A rst course in Discrete Mathematics R. Grimaldi, Discrete and Combinatorial Mathematics If you feel you absolutely must purchase a book, then I strongly recommend you buy a second hand copy: check out www.abebooks.co.uk or www.abebooks.com there you should be able to nd a copy of Rosens book (not the latest edition) for around 2 or so. Assessment: The degree examination will contribute 80% to the nal assessment, a class test will contribute the remaining 20%. To be deemed to have completed the course, students must sit the degree (or resit) examination, attend the whole of the class test, and at least 3 tutorials (see the Level 2 General Information sheet for further details regarding absence for a valid reason). Class Test: The class test will be held during a lecture hour, at a date and location to be announced. Further information will be announced in lectures and posted on Moodle. Note that no resits of the class test are possible. Degree Examination: The degree examination will be held in April/May and will consist of one paper in which all questions must be answered to obtain full credit. The duration of the exam will be 1 hour and 30 minutes. A resit will be available in August/September note that normally a grade awarded at resit level will not earn more than 10 grade points.

Course Content: The course will cover a subset of the following topics: Sets, relations and functions Graphs Introduction and examples (complete and bipartite graphs) Degree of vertices, Handshaking Lemma, isomorphism of graphs, Paths and circuits, connectedness, trees, Planarity, Eulers Theorem, Euler circuits and paths, Hamiltonian circuits and paths. Counting Basic principles, rule of sum and product, inclusion/exclusion principle and pigeonhole principle, Permutations and combinations, binomial theorem and binomial identities, Multinomials and multinomial theorem, Combinations with repetition, applications to counting solutions of equations, Recurrence relations, generating functions and partitions Number Theory and Cryptography Review of basic notions, Fermat and Euler Theorems, Applications in cryptography and error correcting codes, Hamming codes and basic linear algebra over nite elds, Computational aspects of numbers, such as representations in dierent bases and length of computations. Logic and Boolean Algebra Propositional calculus, truth tables for compound expressions, Boolean algebra (boolean sum, product; equality of Boolean functions; identities; duality; abstract denition of a Boolean algebra, Boolean functions), Logic gates; basic predicate calculus and use of quantiers. Intended Learning Outcomes: By the end of the course students should be able to solve problems involving bipartite graphs, complete graphs, Eulerian and Hamiltonian Graphs, apply the binomial and multinomial theorems, the inclusion/exclusion principle and the pigeonhole principles in appropriate contexts, use ordered and unordered partitions appropriately, nd integer solutions to problems involving combinatorial constrains, solve recurrence relations, apply basic notations, congruance theory and the Fermat and Euler Theorems in crypotography and error correcting codes and Hamming codes, represent numbers in dierent bases, deal with computational aspects of numbers, especially length of computations, demonstrate a thorough knowledge of and ability to solve problems concerning the propositional calculus, truth tables, Boolean algebras, logic gates and the basic predicate calculus.