lec-8 - Administration Please be considerate in that last...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Administration Please, be considerate in that last minute!! Administration Please, be considerate in that last minute!! Thanks!! CS70: Satish Rao: Lecture 8. Outline. 1. Modular Arithmetic: review. 2. Inverses for Modular Arithmetc: Greatest Common Divisor. 3. Euclid’s GCD Algorithm 4. Euclid’s Extended GCD Algorithm. Modular Arithmetic: refresher. x is congruent to y modulo m or “ x ≡ y ( mod m ) ” if ( x- y ) is divisible by m . Modular Arithmetic: refresher. x is congruent to y modulo m or “ x ≡ y ( mod m ) ” if ( x- y ) is divisible by m . ...or x and y have the same remainder w.r.t. m . Modular Arithmetic: refresher. x is congruent to y modulo m or “ x ≡ y ( mod m ) ” if ( x- y ) is divisible by m . ...or x and y have the same remainder w.r.t. m . Fact: Addition, subtraction, multiplication can be done with any equivalent x and y . Modular Arithmetic: refresher. x is congruent to y modulo m or “ x ≡ y ( mod m ) ” if ( x- y ) is divisible by m . ...or x and y have the same remainder w.r.t. m . Fact: Addition, subtraction, multiplication can be done with any equivalent x and y . or “ a ≡ c ( mod m ) and b ≡ d ( mod m ) = ⇒ a + b ≡ c + d ( mod m ) and a · b = c · d ( mod m ) ” Modular Arithmetic: refresher. x is congruent to y modulo m or “ x ≡ y ( mod m ) ” if ( x- y ) is divisible by m . ...or x and y have the same remainder w.r.t. m . Fact: Addition, subtraction, multiplication can be done with any equivalent x and y . or “ a ≡ c ( mod m ) and b ≡ d ( mod m ) = ⇒ a + b ≡ c + d ( mod m ) and a · b = c · d ( mod m ) ” Proof Idea: Do addition(multiplication) in regular arithmetic results differ by multiple of m . Modular Arithmetic: refresher. x is congruent to y modulo m or “ x ≡ y ( mod m ) ” if ( x- y ) is divisible by m . ...or x and y have the same remainder w.r.t. m . Fact: Addition, subtraction, multiplication can be done with any equivalent x and y . or “ a ≡ c ( mod m ) and b ≡ d ( mod m ) = ⇒ a + b ≡ c + d ( mod m ) and a · b = c · d ( mod m ) ” Proof Idea: Do addition(multiplication) in regular arithmetic results differ by multiple of m . QED... Modular Arithmetic: refresher. x is congruent to y modulo m or “ x ≡ y ( mod m ) ” if ( x- y ) is divisible by m . ...or x and y have the same remainder w.r.t. m . Fact: Addition, subtraction, multiplication can be done with any equivalent x and y . or “ a ≡ c ( mod m ) and b ≡ d ( mod m ) = ⇒ a + b ≡ c + d ( mod m ) and a · b = c · d ( mod m ) ” Proof Idea: Do addition(multiplication) in regular arithmetic results differ by multiple of m . QED... ish Modular Arithmetic: refresher. x is congruent to y modulo m or “ x ≡ y ( mod m ) ” if ( x- y ) is divisible by m ....
View Full Document

This note was uploaded on 02/29/2012 for the course COMPSCI 70 taught by Professor Rau during the Fall '11 term at Berkeley.

Page1 / 118

lec-8 - Administration Please be considerate in that last...

This preview shows document pages 1 - 12. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online