This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: ≠ 0, c ≠ 0. Prove or disprove: if acbc, then ab. Corollary 1 . Let a, b, and c be integers and a ≠ 0. If ab and ac, then a(mb+nc) whenever m and n are integers. Division Algorithm Let a and d be integers with d ≠ 0. Then there exist unique integers q and r, 0 ≤ r < d, such that a= q.d+r. Terminology a = dividend, d = divisor, q = quotient, and r = remainder q = a div d & r = a mod d Problem 9 b . What are the quotient and remainder when 111 is divided by 11? 21 (c). 21 (b)....
View
Full
Document
This note was uploaded on 03/21/2012 for the course CS 3333 taught by Professor Boppana during the Fall '11 term at The University of Texas at San Antonio San Antonio.
 Fall '11
 Boppana

Click to edit the document details