lec6 - 3 S 3 )%m 3 =(6 S 3 )%7=1 Thus, (S 1 , S 2 , S 3 ) =...

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

View Full Document Right Arrow Icon
1 CSE20 Lecture 6 4/19/11 CK Cheng UC San Diego
Background image of page 1

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

View Full DocumentRight Arrow Icon
Residual Numbers (NT-1 and Shaum’s Chapter 11) Introduction Definition Operations Range of numbers Conversion 2
Background image of page 2
Conversion 3 Number x Residual number (x 1 , x 2 , …, x k ) +, -, x operations for each x i under m i Chinese Remainder Theorem Mod Operation Moduli (m 1 , m 2 , …, m k ) Results
Background image of page 3

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

View Full DocumentRight Arrow Icon
Chinese Remainder Theorem Given a residual number (r 1 , r 2 , …, r k ) with moduli (m 1 , m 2 , …, m k ), where all m i are mutually prime, set M= m 1 ×m 2 × …×m k , and M i =M/m i . Let S i be the solution that (M i ×S i )%m i = 1 Then we have the corresponding number x = (∑ i=1,k (M i S i r i ))%M. 4
Background image of page 4
Example Given (m 1 ,m 2 ,m 3 )=(2,3,7), M=2×3×7=42, we have M 1 =m 2 ×m 3 =3×7=21 (M 1 S 1 )%m 1 =(21 S 1 )%2=1 M 2 =m 1 ×m 3 =2×7=14 (M 2 S 2 )%m 2 =(14 S 2 )%3=1 M 3 =m 1 ×m 2 =2×3=6 (M
Background image of page 5

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

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 3 S 3 )%m 3 =(6 S 3 )%7=1 Thus, (S 1 , S 2 , S 3 ) = (1,2,6) For a residual number (0,2,1): x=(M 1 S 1 r 1 + M 2 S 2 r 2 + M 3 S 3 r 3 )%M 5 Example For a residual number (1,2,5): x=(M 1 S 1 r 1 + M 2 S 2 r 2 + M 3 S 3 r 3 )%M = (2111 + 1422 + 665)%42 = (21 + 56 + 180)%42 = 257%42 = 5 6 Proof of Chinese Remainder Theorem Let A = i=1,k (M i S i r i ), we show that 1. A%m v = r v and 2. x=A%M is unique. 1. A%m v = ( i=1,k (M i S i r i ) )% m v = ((M i S i r i ) % m v )%m v = (M v S v r v )%m v = [(M v S v )%m v r v %m v ]%m v = r v %m v = r v 2. Proof was shown in lecture 5. 7...
View Full Document

This note was uploaded on 12/11/2011 for the course CSE 20 taught by Professor Foster during the Fall '08 term at UCSD.

Page1 / 7

lec6 - 3 S 3 )%m 3 =(6 S 3 )%7=1 Thus, (S 1 , S 2 , S 3 ) =...

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

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