34h - Discrete Mathematics Chinese Remainder Theorem 34-2...

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

View Full Document Right Arrow Icon
Introduction Chinese Remainder Theorem Discrete Mathematics Andrei Bulatov Discrete Mathematics – Chinese Remainder Theorem 34-2 Previous Lecture Residues and arithmetic operations Caesar cipher Pseudorandom generators Divisors of zero Inverse Discrete Mathematics – Chinese Remainder Theorem 34-3 Linear Congruences A congruence of the form ax b (mod m) where m is a positive integer, a and b are integers, and x is a variable, is called a linear congruence . We will solve linear congruences If a is relatively prime with m, then it has the inverse . Then ax b (mod m) x b (mod m) Find the inverse of 3 modulo 7 Solve the linear congruence 3x 4 (mod m) 1 a - 1 a - 1 a - 1 a - Discrete Mathematics – Chinese Remainder Theorem 34-4 The Chinese Remainder Theorem A linear congruence is similar to a single linear equation. What about systems of equations (Sun Tzu’s puzzle, 400 – 460 BC): “There are certain things whose number is unknown. When divided by 3, the remainder is 2;
Background image of page 1

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

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

This note was uploaded on 05/18/2010 for the course MACM MACM 101 taught by Professor Andreibulatov during the Spring '10 term at Simon Fraser.

Page1 / 2

34h - Discrete Mathematics Chinese Remainder Theorem 34-2...

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

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