The main objectives of the course are to: • Introduce concepts of mathematical logic for analyzing propositions and proving theorems. • Demonstrate the ability to write and evaluate a proof or outline the basic structure of and give examples of each proof technique described. • Use sets for solving applied problems, and use the properties of set operations algebraically. • Investigate functions as relations and their properties. • State and use the Quotient-Remainder Theorem (Division Algorithm) and construct divisibility arguments. • Apply the Euclidian Algorithm.

Temps présentiel : 25 heures

Charge de travail étudiant : 100 heures

Méthode(s) d'évaluation : Examen écrit

Référence :
Discrete Mathematics and its applications by Kenneth H. Rosen Eight Edition.