MA121 Lecture Notes - Lecture 8: Greatest Common Divisor, If And Only If

45 views6 pages
School
Department
Course
Professor

Document Summary

Ma121 lecture week 8 introduction to mathematical proofs. Is 17 a prime: yes or no, no proper factors, 17 = (8)2 + 1, 17 = (5)3 + 2, 17 = (3)5 + 2, 17 = (2)7 + 3, larger number = harder to determine. We call q the quotient and r the remainder when a is divided by b: 2. The remainder r is 0 iff b is a factor of a (i. e. , b|a. ) 6: 1, 3, 3|3 and 1|3, but 3 | 2. If c|d, d = 9, c some q e z. Gcd (a, b) = gcd (b, r) Euclid"s algorithm: to find gcd (a, b), where a, b e n divide b into a to obtain a = q1 b +r1 where q1, r1 e z and. 0 r1 < b: note that since gcd (a, b) = gcd (b, a) we can assume b a without loss of generality.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions