MATH 135 (Algebra for Honours Mathematics) is one of the most difficult first-year courses in the University of Waterloo. This course covers the following topics:
- Logic, proofs, mathematical induction
- Divisibility, primes, GCD
- Extended Euclidean algorithm, linear Diophantine equations
- Linear congruences, Fermat’s little theorem, Chinese remainder theorem
- Public key cryptography, RSA, including fast exponentiation
- Complex numbers, the complex plane, polar representation
- De Moivre’s theorem, the Fundamental theorem of algebra
- Polynomials, factorization, roots, error-correcting codes
- Equations over finite fields, partial fractions
To be successful in MATH 135 you really need to know the theorems, definitions, and methods very well. The proofs are the most important part of Math 135.
In this page we upload any material that we find useful for this course.
- New version of the Math 135 course notes (August 2018).
- Sample midterm Math 135 Fall 2019.
If you need help with Math 135, contact us.