Just to go through, again, the topics of the week.
these roughly correspond to 2 minutes each.
So we talked about "the following are equivalent". We'll see what that is when we get to it.
What I mean by this is we had a bunch of criteria for congruences
and these list them all.
We talked about inverses, multiplicative inverses in Z mod m.
We talked about the Linear Congruence Theorem, the second part to it.
So where we reword it using our new notation with the equivalence classes.
Then we talked about a couple of major theorems in this course:
Fermat’s Little Theorem, Chinese Remainder Theorem and Splitting the Modulus.
Then we wrapped up the week with a brief introduction to cryptography.
Again remember our goal is to head to RSA, which we'll do next week.
Actually I’m probably going to isolate that in its own video,
but here's the overview, and then I guess we finished off with the square and multiply algorithm.
It gives you a quick way to compute
large powers of numbers
to not necessarily prime moduli.