Lect. 12: Number Theory
Lect. 12: Number Theory. Prime and Relative Prime Numbers Modular Arithmetic Fermat’s and Euler’s Theorem Extended Euclid’s Algorithm. Contents. b|a (“ b divides a ”, “ b is a divisor of a ”) if a = kb for some k, where a, b, and k are integers, and b 0 If a|1, then a = 1
533 views • 20 slides