{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

L05_InversesGCDs

# L05_InversesGCDs - COMP170 Discrete Mathematical Tools for...

This preview shows pages 1–12. Sign up to view the full content.

1-1 COMP170 Discrete Mathematical Tools for Computer Science Discrete Math for Computer Science K. Bogart, C. Stein and R.L. Drysdale Section 2.2, pp. 56-69 Inverses and GCDs Version 2.0: Last updated, May 13, 2007 Slides c 2005 by M. J. Golin and G. Trippen

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2-1 2.2 Inverses and Greatest Common Divisors Solutions to Equations and Inverses mod n Converting Modular Equations to Normal Equations Greatest Common Divisors Euclid’s Division Theorem Euclid’s GCD Algorithm Extended GCD Agorithm Computing Inverses
3-1 Greatest Common Divisors: Definitions Euclid’s Division Theorem Euclid’s GCD Algorithm Solutions to Eqns & Inverses mod n Converting mod n Eqns to Normal Ones Extended GCD Algorithm Computing Inverses mod n Proving tool from prev lecture

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
3-2 Greatest Common Divisors: Definitions Euclid’s Division Theorem Euclid’s GCD Algorithm Solutions to Eqns & Inverses mod n Converting mod n Eqns to Normal Ones Extended GCD Algorithm Computing Inverses mod n Proving tool from prev lecture This lecture develops lots of tools for later use. Here’s a chart describing the relationship between the various parts
3-3 Greatest Common Divisors: Definitions Euclid’s Division Theorem Euclid’s GCD Algorithm Solutions to Eqns & Inverses mod n Converting mod n Eqns to Normal Ones Extended GCD Algorithm Computing Inverses mod n Proving tool from prev lecture This lecture develops lots of tools for later use. Here’s a chart describing the relationship between the various parts Introduction to proof by smallest counterexample Introduction to proof by contradiction

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
4-1 Definition: Positive integer m is a divisor of integer n if n = mq for some integer q if m is a divisor of n we write m | n . (say) “ m divides n if m is a not a divisor of n we write m | n . (say) “ m does not divide n
4-2 Definition: Positive integer m is a divisor of integer n if n = mq for some integer q if m is a divisor of n we write m | n . (say) “ m divides n if m is a not a divisor of n we write m | n . (say) “ m does not divide n Examples: 1 | 30 , 5 | 30 , 5 | 35 , 5 | 31

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
5-1 If p is a divisor of both m and n then p is a common divisor of m and n gcd ( m, n ) denotes the greatest common divisor of m and n . 1 is aways a common divisor of m and n Definition:
5-2 If p is a divisor of both m and n then p is a common divisor of m and n gcd ( m, n ) denotes the greatest common divisor of m and n . 1 is aways a common divisor of m and n Definition: Examples: { 1 , 2 , 3 , 6 } are all of the common divisors of 24 and 30 . gcd (24 , 30) = 6

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
6-1 Definition: Positive integer p > 1 is prime if its only divisors are 1 and itself . If p is not prime, it is composite . m and n are relatively prime if they have no common divisor other than 1 , i.e., gcd ( m, n ) = 1 .
6-2 Definition: Positive integer p > 1 is prime if its only divisors are 1 and itself . If p is not prime, it is composite .

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern