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
B is the right answer because a is too short and c and d are too long
The answer is C to this question
Answer:
No
Step-by-step explanation:
No function, because the same output can't have two different inputs.
Answer:
She did not use the reciprocal of the divisor.
She added the numerators.