Monday, October 09, 2006

Monday Oct 9

Weak induction proof of the "division algorithm".
GCDs. Euclid's algorithm for computing GCDs.
We started proving, by strong induction, that this does actually compute GCDs, but didn't finish it.
Posted by at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)