{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

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

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

View Full Document Right Arrow Icon
Administration Please, be considerate in that last minute!!
Background image of page 1

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

View Full Document Right Arrow Icon
Administration Please, be considerate in that last minute!! Thanks!!
Background image of page 2
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.
Background image of page 3

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

View Full Document Right Arrow Icon
Modular Arithmetic: refresher. x is congruent to y modulo m or x y ( mod m ) if ( x - y ) is divisible by m .
Background image of page 4
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 .
Background image of page 5

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

View Full Document Right Arrow Icon
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 .
Background image of page 6
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 )
Background image of page 7

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

View Full Document Right Arrow Icon
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 .
Background image of page 8
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...
Background image of page 9

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

View Full Document Right Arrow Icon
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
Background image of page 10
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 Can compute with representative in { 0 ,..., m - 1 } .
Background image of page 11

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

View Full Document Right Arrow Icon
Modular Arithmetic: refresher.
Background image of page 12
Image of page 13
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}