We covered sections 4.10-4.14. In particular, we did a sample proof with congruence mod k and did arithmetic examples with modular numbers. We saw the method of computing large powers in modular arithmetic by (a) breaking up the exponent into powers of 2 and (b) using repeated squaring to compute results for the power-of-2 exponents.
Announcements