Unformatted text preview: ferent). Comment on another student’s proof. Post a question whose answer you care about. Answer another students question. Problem 9
2: Prove this theorem that we have been using. For any integers m and n, there is an integer q and an integer r, with 0 ≤ r < m so that n = qm + r. Hint: Induction on n. Problem 9
3: Prove: If m, n, q, and r and integers, then the set of common divisors of m and n is the same as the set of c...
View
Full Document
 Winter '11
 JamesKing
 Math, Integers, the00, is00

Click to edit the document details