1,036 M.
mark as brainliest?
Answer:
Brainless bruv I gonna say that's a insult but ok
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:
i think B.
Step-by-step explanation:
Hope this helps :p