RankRizz
JEE MAIN 2023 · 31 JAN S1+4 / −1EASYTRANSCRIBED

JEE Main 2023 Mathematics question — Divisibility and remainder problems

The remainder on dividing 5995^{99} by 11 is ______.

SOLUTION

We need to find 599mod  115^{99} \mod 11.

By Fermat's Little Theorem, since 11 is prime and gcd⁡(5,11)=1\gcd(5, 11) = 1:

510≡1(mod11)5^{10} \equiv 1 \pmod{11}

Dividing the exponent: 99=10×9+999 = 10 \times 9 + 9

599=(510)9×59≡19×59=59(mod11)5^{99} = (5^{10})^9 \times 5^9 \equiv 1^9 \times 5^9 = 5^9 \pmod{11}

Computing 59mod  115^9 \mod 11 step by step:

51≡55^1 \equiv 5

52≡25≡3(mod11)5^2 \equiv 25 \equiv 3 \pmod{11}

54≡32=9(mod11)5^4 \equiv 3^2 = 9 \pmod{11}

58≡92=81≡4(mod11)5^8 \equiv 9^2 = 81 \equiv 4 \pmod{11}

59=58×5≡4×5=20≡9(mod11)5^9 = 5^8 \times 5 \equiv 4 \times 5 = 20 \equiv 9 \pmod{11}

The remainder is 9.

Tagged Divisibility and remainder problems. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicDivisibility and remainder problems
TypeNumerical answer