Summary, cont.:
Special Case of Chinese Remainder Theorem:
p, q prime, n= pq
There is a unique x < pq such that
x = a mod p
x = b mod q
Easy corollary: x = a mod p, x = a mod q
=> x = a mod n.
Previous slide
Next slide
Back to first slide
View graphic version