MATH1061 — Dashboard
Course landing note · 13 weeks · 89 notes
Study guides: Full course · Week 1 · Week 2 · Week 3 · Week 4 · Week 5 · Week 6 · Week 7 · Week 8 · Week 9 · Week 10 · Week 11 · Week 12 · Week 13
Week 1
Lectures
- 2026-07-27 · Lecture 1 — Welcome & Warm-up Problems
- 2026-07-30 · Lecture 3 — Conditional Statements
- 2026-07-30 · Lecture 2 — Logical Form and Logical Equivalence
Concepts
- Conditional & Biconditional Statements
- Diagram and Notation Conventions
- Euler Circuits and Trails
- Graphs
- Logical Connectives
- Logical Equivalence & Laws
- Practice Problems — the Semester-wide Set
- Proof Techniques — Direct, Counterexample, Contradiction, Contraposition
- Solving Recurrence Relations
- The Examination Formula Page
- The Pigeonhole Principle
Week 2
Lectures
- 2026-08-03 · Lecture 4 — Valid and Invalid Arguments
- 2026-08-06 · Lecture 6 — Multiple Quantifiers, Negations of Quantified Statements
- 2026-08-06 · Lecture 5 — Valid Arguments (cont’d), Quantified Statements
Concepts
- Conditional & Biconditional Statements
- Determining Argument Validity — Worked Examples
- Divisibility & Unique Factorisation
- Logical Equivalence & Laws
- Practice Problems — the Semester-wide Set
- Proof Techniques — Direct, Counterexample, Contradiction, Contraposition
- Quantified Statements
- Valid Argument Forms
Week 3
Lectures
- 2026-08-10 · Lecture 7 — Direct Proof, Counterexample
- 2026-08-13 · Lecture 8 — Proof by Contradiction
- 2026-08-13 · Lecture 9 — Proof by Contraposition, Rational Numbers
Concepts
- Conditional & Biconditional Statements
- Diagram and Notation Conventions
- Divisibility & Unique Factorisation
- Logical Equivalence & Laws
- Practice Problems — the Semester-wide Set
- Proof Techniques — Direct, Counterexample, Contradiction, Contraposition
- Quantified Statements
- Rational & Irrational Numbers
Week 4
Lectures
- 2026-08-17 · Lecture 10 — Divisibility
- 2026-08-20 · Lecture 12 — Modular Arithmetic and the Euclidean Algorithm
- 2026-08-20 · Lecture 11 — Modular Arithmetic
Concepts
- Diagram and Notation Conventions
- Divisibility & Unique Factorisation
- gcd, lcm & the Euclidean Algorithm
- Modular Arithmetic, Floor & the Quotient-Remainder Theorem
- Practice Problems — the Semester-wide Set
- Proof Techniques — Direct, Counterexample, Contradiction, Contraposition
- Strong Induction and the Well-Ordering Principle
Week 5
Lectures
- 2026-08-24 · Lecture 13 — Sequences and Mathematical Induction
- 2026-08-27 · Lecture 14 — Strong Mathematical Induction and the Well-Ordering Principle
Concepts
Week 6
Lectures
- 2026-08-31 · Lecture 15 — Mathematical Induction and Recursive Definitions
- 2026-08-31 · Lecture 16 — Solving Recurrence Relations
- 2026-09-03 · Lecture 18 — Proving Properties of Sets and Intro to Functions
- 2026-09-03 · Lecture 17 — Set Theory Definitions and Examples
Concepts
- Conditional & Biconditional Statements
- Functions on General Sets
- Logical Equivalence & Laws
- Mathematical Induction
- Modular Arithmetic, Floor & the Quotient-Remainder Theorem
- Practice Problems — the Semester-wide Set
- Proof Techniques — Direct, Counterexample, Contradiction, Contraposition
- Proving Properties of Sets
- Recursive Definitions
- Sequences and Summations
- Sets and Set Notation
- Solving Recurrence Relations
- Strong Induction and the Well-Ordering Principle
- The Examination Formula Page
Week 7
Lectures
- 2026-09-07 · Lecture 19 — Functions: One-to-One, Onto, Inverse
- 2026-09-08 · Lecture 20 — Composition of Functions
Concepts
Week 8
Lectures
- 2026-09-14 · Lecture 21 — Cardinalities
- 2026-09-15 · Lecture 22 — Countable and Uncountable Sets
- 2026-09-17 · Lecture 23 — Relations on Sets; Reflexivity, Symmetry and Transitivity
Concepts
- Cardinality
- Composition of Functions
- Countable and Uncountable Sets
- Divisibility & Unique Factorisation
- Functions on General Sets
- Inverse Functions
- Modular Arithmetic, Floor & the Quotient-Remainder Theorem
- One-to-One and Onto Functions
- Partial Order Relations
- Practice Problems — the Semester-wide Set
- Proof Techniques — Direct, Counterexample, Contradiction, Contraposition
- Reflexive, Symmetric and Transitive Relations
- Relations on Sets
- Sets and Set Notation
- Strong Induction and the Well-Ordering Principle
- The Examination Formula Page
- The Integers Modulo n
Week 9
Lectures
- 2026-09-21 · Lecture 24 — Equivalence Relations
- 2026-09-22 · Lecture 25 — Partial Order Relations
- 2026-09-24 · Lecture 26 — Definitions and Examples of Groups
Concepts
- Antisymmetric Relations
- Cayley Tables
- Composition of Functions
- Countable and Uncountable Sets
- Divisibility & Unique Factorisation
- Equivalence Classes and Partitions
- Equivalence Relations
- Groups
- Hasse Diagrams
- Modular Arithmetic, Floor & the Quotient-Remainder Theorem
- One-to-One and Onto Functions
- Partial Order Relations
- Practice Problems — the Semester-wide Set
- Rational & Irrational Numbers
- Reflexive, Symmetric and Transitive Relations
- Sets and Set Notation
- The Integers Modulo n
- The Symmetric Group
Week 10
Lectures
- 2026-10-06 · Lecture 27 — Elementary Properties of Groups
- 2026-10-08 · Lecture 28 — Definitions and Examples of Fields
Concepts
Week 11
Lectures
- 2026-10-12 · Lecture 29 — Introduction to Counting
- 2026-10-13 · Lecture 30 — Counting Selections
Concepts
Week 12
Lectures
- 2026-10-19 · Lecture 31 — Probability, Binomial Coefficients
- 2026-10-20 · Lecture 32 — Inclusion/Exclusion
- 2026-10-22 · Lecture 33 — Pigeonhole Principle, Introduction to Graph Theory
Concepts
Week 13
Lectures
- 2026-10-26 · Lecture 34 — Walks, Trails and Circuits
- 2026-10-27 · Lecture 35 — Matrix Representations of Graphs
- 2026-10-29 · Lecture 36 — Trees
Concepts
Reference notes
Every evergreen concept note in the course, with the weeks that link to it.
- Adjacency Matrices — week 13
- Antisymmetric Relations — week 9
- Binomial Coefficients — week 12
- Cardinality — weeks 8, 11
- Cayley Tables — weeks 9, 10
- Composition of Functions — weeks 7, 8, 9, 10
- Conditional & Biconditional Statements — weeks 1, 2, 3, 6
- Countable and Uncountable Sets — weeks 8, 9
- Counting Principles — weeks 11, 12
- Counting Selections — weeks 11, 12
- Determining Argument Validity — Worked Examples — week 2
- Diagram and Notation Conventions — weeks 1, 3, 4, 5
- Divisibility & Unique Factorisation — weeks 2, 3, 4, 5, 8, 9
- Equivalence Classes and Partitions — week 9
- Equivalence Relations — week 9
- Euler Circuits and Trails — weeks 1, 13
- Fields — week 10
- Functions on General Sets — weeks 6, 7, 8
- gcd, lcm & the Euclidean Algorithm — week 4
- Graphs — weeks 1, 12, 13
- Groups — weeks 9, 10
- Hasse Diagrams — week 9
- Incidence Matrices — week 13
- Inclusion/Exclusion — week 12
- Inverse Functions — weeks 7, 8, 10
- Logical Connectives — week 1
- Logical Equivalence & Laws — weeks 1, 2, 3, 6
- Mathematical Induction — weeks 5, 6
- Modular Arithmetic, Floor & the Quotient-Remainder Theorem — weeks 4, 6, 8, 9
- One-to-One and Onto Functions — weeks 7, 8, 9
- Partial Order Relations — weeks 8, 9
- Practice Problems — the Semester-wide Set — weeks 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13
- Probability — week 12
- Proof Techniques — Direct, Counterexample, Contradiction, Contraposition — weeks 1, 2, 3, 4, 5, 6, 7, 8, 13
- Proving Properties of Sets — week 6
- Quantified Statements — weeks 2, 3
- Rational & Irrational Numbers — weeks 3, 9
- Recursive Definitions — weeks 6, 11
- Reflexive, Symmetric and Transitive Relations — weeks 8, 9
- Relations on Sets — week 8
- Sample Mid-Semester Exams — not linked from any weekly note yet
- Sequences and Summations — weeks 5, 6
- Sets and Set Notation — weeks 6, 8, 9, 11, 12
- Solving Recurrence Relations — weeks 1, 6
- Strong Induction and the Well-Ordering Principle — weeks 4, 5, 6, 8, 13
- Subgroups and Cyclic Groups — week 10
- The Examination Formula Page — weeks 1, 6, 8, 12
- The Integers Modulo n — weeks 8, 9, 10
- The Pigeonhole Principle — weeks 1, 12, 13
- The Symmetric Group — weeks 9, 10, 11
- Trees — week 13
- Valid Argument Forms — week 2
- Walks, Trails and Circuits — week 13