- be acquainted with logical mathematical reasoning; - learn fundamental and fundative notions in modern Mathematics (sets, functions, natural numbers, cardinality); - comprehend and master important results of discrete Mathematics and their computational applications (Euclidean Algorithm, modular arithmetic); - be able to distinguish simple algebraic structures (monoids, groups).
Lectures
1. Basic notions - Sets - Functions - Natural numbers and induction - Complex numbers - Equivalence relation - Cardinality - Partial orders
2. Discrete Mathematics - Integers - Euclidean Algorithm - Modular arithmetics
3. Algebraic structures - Monoids - Groups
Teaching support material will be posted on Aulaweb
Ricevimento: By appointment.
RICCARDO CAMERLO (President)
ALESSIO CAMINATA (President Substitute)
FRANCESCO STRAZZANTI (President Substitute)
According to the calendar approved by "Consiglio dei Corsi di Studio in Informatica e Computer Science"
Written exam. Students with DSA certification ("specific learning disabilities"), disability or other special educational needs are advised to contact the teacher at the beginning of the course to agree on teaching and examination methods that, in compliance with the teaching objectives, take account of individual learning arrangements and provide appropriate compensatory tools.
