MATA02 - Lecture 10d - Roots in modular arithmetic using Euler's Theorem

Subset-Sum Dynamic Programming Example Matrix Infill

Integral of x ln x^2 from 1 to e

Sigma notation - brief overview

MATA02 - Lecture 12c - Final exam review

MATA02 - Lecture 12b - Hybrid cryptograph interactive

MATA02 - Lecture 12a - Public-key cryptography and RSA

MATA02 - Lecture 11b - Encryption - Caesar Cipher interactive

MATA02 - Lecture 11a - Fermat Primality Test

MATA02 - Lecture 10d - Roots in modular arithmetic using Euler's Theorem

MATA02 - Lecture 10c - Euler's Theorem

MATA02 - Lecture 10b - Powers in non-prime modulus interactive

MATA02 - Lecture 10a - Review and proof of Fermat's Little Theorem

MATA02 - Lecture 9c - Reciprocals via Fermat's Little Theorem

MATA02 - Lecture 9d - Roots in modular arithmetic (with prime modulus)

MATA02 - Lecture 9a - Fermat's Little Theorem

MATA02 - Lecture 8d - Modular power patterns

MATA02 - Lecture 8b - More modular division (Euclidean algorithm)

MATA02 - Lecture 8c - Modular exponentiations through successive squaring.

MATA02 - Lecture 8a - Modular division and reciprocals

MATA02 - Lecture 7c - Review of modular arithmetic computations

MATA02 - Lecture 7b - Interactive modular arithmetic bean-bag tossing exercise

MATA02 - Lecture 7a - Congruences and modular arithmetic

MATA02 - Lecture 6b - Modular arithmetic and addition/subtraction

MATA02 - Lecture 6c - Modular arithmetic and multiplication