gcd s linear
play

GCDs & linear (ab)c = a (bc), a a = 0, combinations a + 0 = a, - PowerPoint PPT Presentation

Arithmetic Assumptions Mathematics for Computer Science MIT 6.042J/18.062J assume usual rules for +, , - : Number Theory: a (b+c) = ab + ac, ab = ba, GCDs & linear (ab)c = a (bc), a a = 0, combinations a + 0 = a, a+1 > a,


  1. Arithmetic Assumptions Mathematics for Computer Science MIT 6.042J/18.062J assume usual rules for +, · · , - : Number Theory: a (b+c) = ab + ac, ab = ba, GCD’s & linear (ab)c = a (bc), a – a = 0, combinations a + 0 = a, a+1 > a, …. Albert R Meyer March 6, 2015 gcd-def. 1 Albert R Meyer March 6, 2015 gcd-def. 2 The Division Theorem Divisibility For b > 0 and any a, have c divides a (c|a) iff q = quotient(a,b) a = k · c for some k � r = remainder(a,b) ∃ unique numbers q, r such that 5|15 because 15 = 3 · 5 a = qb + r and 0 ≤ r < b. n|0 because 0 = 0 · n Take this for granted too! Albert R Meyer March 6, 2015 gcd-def. 3 Albert R Meyer March 6, 2015 gcd-def. 4 1

  2. Simple Divisibility Facts Simple Divisibility Facts • c|a implies c|(sa) • c|a implies c|(sa) [a=k’c implies • if c|a and c|b then (sa)=(sk’)c] c|(a+b) k [if a=k 1 c, b=k 2 c then a+b= (k 1 +k 2 )c ] Albert R Meyer March 6, 2015 gcd-def. 5 Albert R Meyer March 6, 2015 gcd-def. 6 Simple Divisibility Facts Common Divisors c a common divisor of a,b • c|a implies c|(xa) Common divisors of a & b • if c|a and c|b then divide integer linear c|(a+b) (sa+tb) combinations of a & b. integer linear combination of a and b Albert R Meyer March 6, 2015 gcd-def. 7 Albert R Meyer March 6, 2015 gcd-def. 9 2

  3. GCD GCD gcd(a,b) ::= the greatest gcd(a,b) ::= the greatest common divisor of a and b common divisor of a and b gcd(10,12) = 2 lemma: p prime implies gcd(p,a) = 1 or p gcd(13,12) = 1 proof: The only divisors gcd(17,17) = 17 of p are ± 1 & ± p. gcd(0, n) = n for n > 0 Albert R Meyer March 6, 2015 gcd-def. 10 Albert R Meyer March 6, 2015 gcd-def. 11 3

  4. MIT OpenCourseWare http s ://ocw.mit.edu 6.042J / 18.062J Mathematics for Computer Science Spring 20 15 For information about citing these materials or our Terms of Use, visit: http s ://ocw.mit.edu/terms.

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend