This course covers topics in discrete mathematics such as Knots & Invariants, Monsky's Theorem, Magic Squares, Playfair Cypher, Pascal's Triangle, Fibonacci Sequence, Integer Partitions, Eulerian Paths and Circuits, Hill Encryption with Python, Art Gallery Problem, and The Axiom of Choice. The course aims to teach problem-solving skills, mathematical reasoning, and cryptography techniques. It is suitable for individuals interested in mathematics, computer science, or cryptography. The teaching method includes theoretical explanations, practical examples, and coding exercises.
Overview
Syllabus
Introduction to Knots & Invariants.
Sharing a Sandwich Using Math - Monsky's Theorem.
Magic Squares.
Playfair Cypher.
Pascal's Triangle + Fibonacci Sequence.
Integer Partitions (Discrete Maths).
Eulerian Paths and Circuits.
Hill Encryption (w/Python).
Art Gallery Problem.
The Axiom of Choice.
Taught by
math at andrews
