Fermat’s theorem gives $13^{16}\equiv1\pmod{17}$. Since 99 ≡ 3 modulo 16, reduce to 13³. Now $13\equiv-4$, so $13^3\equiv-64\equiv4\pmod{17}$. The answer is 4.
More Discrete Mathematics: Combinatorics (Counting, Recurrence Relations, Generating Functions) questions
GATE 2017 CS (CS2) Q57– The ordinary generating function of aₙ is (1+z)/(1-z)3. Find a₃−a₀.
GATE 2012 CS (CS1) Q47– How many surjections exist from an n-element set (n≥2) to a two-element set?
GATE 2010 CS (CS1) Q37– A divisor of 1099 is chosen uniformly at random. What is the probability that it is a…