Math 211

Index of Hand-outs



Date No. Title
12 Sep 17 01/02 Math 211 - Course Information and Course Outline (2 pages)
* Algebraic Methods (2 pages)
* Number Systems
14 Sep 17 * Divisibility
* Course Guidelines
15 Sep 17 * The Principle of Induction
* The Euclidean Algorithm
19 Sep 17 * The Greatest Common Divisor
21 Sep 17 * The Division Algorithm
* The Euclidean Algorithm: First and Second Version
22 Sep 17 03 MAPLE Homework Instructions
04 MAPLE hints
* Computer Lab: MAPLE print-out (5pp.)
* Basic MAPLE commands (4pp.)
26 Sep 17 * The Euclidean Algorithm: Second Version (formal procedure)
* The Extended Euclidean Algorithm: Examples 1 and 2 (2pp.)
* The Extended Euclidean Algorithm: Theorem 3
28 Sep 17 * Diophantine equations (2 pages)
* The Plimpton 322 Clay Tablet
* The GCD-criterion and its consequences
29 Sep 17 * The General Solution of the Dioph. Eq'n mx + ny = c
03 Oct 17 * How to solve mx + ny = c
05 Oct 17 * Proof of the Formula (2pp.)
06 Oct 17 * How to solve mx + ny + kz = c
10 Oct 17 * Prime numbers
* Some unsolved conjectures about primes
12 Oct 17 * The Fundamental Theorem of Arithmetic
13 Oct 17 * The GCD-formula
* The GCD-formula vs. the Euclidean algorithm



Index of Term 2 Handouts     Math 211 Home Page