We finished proving that Euclid's algorithm works. This required strong, not just weak, induction.
The main consequence: the GCD of A and B can be written as mA+nB for some integers m,n. With this we'll eventually prove that integers have unique factorizations into primes.
Next time (Friday) we'll review the course to date, in preparation for the first midterm, on Monday October 16. See the course web page for details.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment