1 .

h a f t a
2 .h a f t a
3 .h a t t a
4 .h a f t a
P is p r im e .
 7 -h a f t a
M o d u la r A r it h m e t i c A B
K
A m o d B : C ÷
↓
R e m a in d e r

A - K -B t c

P r o p e r t ie s → 10 m o d 8 = 2
M M o o d d 8 ⑦
4 1 1+ 15 / m o d 8 = (7 + 3 )
⅓
2 6 m o d 8 = 2

a tb m o d n is s a m e a s G a m o d n / + lb m o d n )] m o d n

10 m o d 8 = 2 ( a x b ) m o d n is s a m e a s [ a m o d a /✗ I b m o d n ) ] m a d
19 m o d 8 = 3 ①
10 0 m o d 8 = ? ⑥

p ro o f : a m o d n - r a ⇒ a = k a in t r a ⇒ a t b - k a .n t r a t k y n t i . is a tb = k a n t i c
b m o d n : b ⇒ b i k b . n t i b
( k a t k b ) n + Ir a t i b )
K C K
ta t b lm o d n = r a t i o
 Bölme
(a- b) mod n is same as [(a mod n) _ (b mod n)] mod n

is mod n= a. C b mod ne ? NOTES: we can not always cancel a common factor in

modular multiplication.

atb mod n = ate b mod n=c ✓ It works only when god (aint: 1

ekok

3:10 mod 8=3.2 ✓ ✓ ortak bölenleri

6. 5 mod 10=6×1
5 mod 8=1 ×

Definition: the set 2n 12 mod 5=2

Is the set of all possible remainders when 12 mod 5=7
we derided by n 12 Mod 5=17
25 = {0,112,314}
28 = {0,112,3141516173

Cogruence (özdeşlik) =

11=3 (mod 8) 11 mod 8 =3

€28

6×5=6 (mod 8) ✓
6×5=30 (mod 8) ✗

Fermat's little Theory

If P is prime, a P does not divide a

Then 97-1=1 (mod P)

a- 7. F- 19 ⇒ 78 = 1 (mod 19)

72 = 11 (mod 19)

72.72 = 1 1.11 (mod /9) = 74=7 (mod 191

121 mod 19

17412 = 1712 1m00 19) ⇒ 78=11 (mod 19)

17812 = 11112 (mod 19) ⇒ 716=7 (mod 19)

716.72 = 7.11 (mod 191 ⇒ 718 = 1 (mod 19)

WXW" = 1 (mod n)
inverse

in 28 what is additive inverse of 3? (8-3--5)

Does 2 have a multiplicative inverse in 28? (V0 god 12181=2+1

0 1 2 3 4 7
× 2X W 0 2 4 6 O 2 4 6
54W 0 527 4 1 63

ged 12,81=2
94 (51-8)=1 ✓

74W 7 6 5 6321
64W o 64 2 0 6 42