Could you possibly post a more high quality picture so its not blurry thanks!
The answer is 19 please like and 5 star
Fermat's little theorem states that

≡a mod p
If we divide both sides by a, then

≡1 mod p
=>

≡1 mod 17

≡1 mod 17
Rewrite

mod 17 as

mod 17
and apply Fermat's little theorem

mod 17
=>

mod 17
So we conclude that

≡1 mod 17
Answer:
Step-by-step explanation:
(3)*2=6
-
(3)*(-2)=-6
6-(-6)=12
3*3=9
+2(-2)=-4
9+ -4= 5