Download - mod arithmetic
![Page 1: mod arithmetic](https://reader034.vdocument.in/reader034/viewer/2022051018/56814982550346895db6cbae/html5/thumbnails/1.jpg)
mod arithmetic
![Page 2: mod arithmetic](https://reader034.vdocument.in/reader034/viewer/2022051018/56814982550346895db6cbae/html5/thumbnails/2.jpg)
mod arithmetic
• a mod m is the remainder of a divided by m• a mod m is the integer r such that
• a = qm + r and 0 <= r < m • again, r is positive
•Examples
• 17 mod 3 = 2• 17 mod 12 = 5 (5 o’clock)•-17 mod 3 = 1
![Page 3: mod arithmetic](https://reader034.vdocument.in/reader034/viewer/2022051018/56814982550346895db6cbae/html5/thumbnails/3.jpg)
![Page 4: mod arithmetic](https://reader034.vdocument.in/reader034/viewer/2022051018/56814982550346895db6cbae/html5/thumbnails/4.jpg)
a is congruent to b modulo m if m divides a - b
b)m|(am)b(a mod
congruences
![Page 5: mod arithmetic](https://reader034.vdocument.in/reader034/viewer/2022051018/56814982550346895db6cbae/html5/thumbnails/5.jpg)
b)m|(am)b(a mod
)5(mod27
)}3(mod2205|{ xxNxx}17,14,11,8,5{
)}3(mod2205|{
xxNxx
![Page 6: mod arithmetic](https://reader034.vdocument.in/reader034/viewer/2022051018/56814982550346895db6cbae/html5/thumbnails/6.jpg)
![Page 7: mod arithmetic](https://reader034.vdocument.in/reader034/viewer/2022051018/56814982550346895db6cbae/html5/thumbnails/7.jpg)
mbmamba modmod)(mod
b)m|(am)b(a mod
a is congruent to b mod m if and only if the remainder of a divided by m is equal to the remainder of b divided by m.
proof
![Page 8: mod arithmetic](https://reader034.vdocument.in/reader034/viewer/2022051018/56814982550346895db6cbae/html5/thumbnails/8.jpg)
b)m|(am)b(a mod
)()(
congruence ofDefn
mod ofDefn
mod ofDefn
modmod)(mod
2121
2121
3
22
11
rrmqq
rrmqmqba
mqba
rmqb
rmqa
mbmamba
mbmamba modmod)(mod
![Page 9: mod arithmetic](https://reader034.vdocument.in/reader034/viewer/2022051018/56814982550346895db6cbae/html5/thumbnails/9.jpg)
21
21
2121
2121
3
22
11
r
zero bemust
)(|But
)()(
congruence ofDefn
mod ofDefn
mod ofDefn
modmod)(mod
r
rr
bam
rrmqq
rrmqmqba
mqba
rmqb
rmqa
mbmamba
b)m|(am)b(a modmbmamba modmod)(mod
![Page 10: mod arithmetic](https://reader034.vdocument.in/reader034/viewer/2022051018/56814982550346895db6cbae/html5/thumbnails/10.jpg)
![Page 11: mod arithmetic](https://reader034.vdocument.in/reader034/viewer/2022051018/56814982550346895db6cbae/html5/thumbnails/11.jpg)
)(mod)(mod)(mod mdbcamdcmba
b)m|(am)b(a mod
If a is congruent to b mod m and c is congruent to d mod m then a+c is congruent to b+d mod m
proof
![Page 12: mod arithmetic](https://reader034.vdocument.in/reader034/viewer/2022051018/56814982550346895db6cbae/html5/thumbnails/12.jpg)
)(mod)(mod)(mod mdbcamdcmba
)(|)(mod
)(|)(mod
dcmmdc
bammba
tydivisibili From))()((|
)(|)(mod
)(|)(mod
dcbam
dcmmdc
bammba
))()((|
tydivisibili From))()((|
)(|)(mod
)(|)(mod
dbcam
dcbam
dcmmdc
bammba
congruence ofDefn ))(mod(
))()((|
tydivisibili From))()((|
)(|)(mod
)(|)(mod
mdbca
dbcam
dcbam
dcmmdc
bammba
b)m|(am)b(a mod
![Page 13: mod arithmetic](https://reader034.vdocument.in/reader034/viewer/2022051018/56814982550346895db6cbae/html5/thumbnails/13.jpg)
![Page 14: mod arithmetic](https://reader034.vdocument.in/reader034/viewer/2022051018/56814982550346895db6cbae/html5/thumbnails/14.jpg)
)(mod)(mod)(mod mbdacmdcmba
If a is congruent to b mod m and c is congruent to d mod mthen ac is congruent to bd mod m
b)m|(am)b(a mod
proof
![Page 15: mod arithmetic](https://reader034.vdocument.in/reader034/viewer/2022051018/56814982550346895db6cbae/html5/thumbnails/15.jpg)
)(mod)(mod)(mod mbdacmdcmba
congruence ofDefn 2
1
mqdc
mqba
)(
)(
2121
2121
2
1
mqqbqdqmbdac
mqqbqdqmbdac
mqdc
mqba
)(mod
)(|
)(
)(
2121
2121
2
1
mbdac
bdacm
mqqbqdqmbdac
mqqbqdqmbdac
mqdc
mqba
b)m|(am)b(a mod
![Page 16: mod arithmetic](https://reader034.vdocument.in/reader034/viewer/2022051018/56814982550346895db6cbae/html5/thumbnails/16.jpg)
Mod arithmetic
• -133 mod 9 = 2 (but in Claire?)• list 5 numbers that are congruent to 4 modulo 12• hash function h(k) = k mod 101
• h(104578690)• h(432222187)• h(372201919)• h(501338753)
examples