Theorem 1 (Division Algorithm). If a and b are integers with b≥ 1, then there erist unique integers q, r with a=qb+r and

[answerhappygod]

Theorem 1 Division Algorithm If A And B Are Integers With B 1 Then There Erist Unique Integers Q R With A Qb R And 1 (26.61 KiB) Viewed 32 times

Theorem 1 (Division Algorithm). If a and b are integers with b≥ 1, then there erist unique integers q, r with a=qb+r and 0≤r<b. The theorem follows from the next two lemmas. Lemma 3. If a and b are integers with b≥ 1, then there exist integers q, r with a = qb+r and 0≤r<b. Proof. Hint: Let S = {a-qb: qeZ, a-qb 20}, and apply the well-ordering property. Lemma 5. The values q, r in (4) are unique. (4) Proof. Hint: Suppose that you have q1, 71 and 92.12 satisfying (4). Prove that r₁ = r2, and then that q= 92.