The remainder obtained when 5^{99} is divided | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(C) We need to find $5^{99} \pmod{13}$.By Fermat's Little Theorem,since $13$ is a prime number and $\gcd(5, 13) = 1$,we have $5^{13-1} \equiv 1 \pmod{

Vedclass · Accepted Answer

$8$

Vedclass · Answer

(C) We need to find $5^{99} \pmod{13}$.By Fermat's Little Theorem,since $13$ is a prime number and $\gcd(5, 13) = 1$,we have $5^{13-1} \equiv 1 \pmod{13}$,which means $5^{12} \equiv 1 \pmod{13}$.We can write $99 = 12 	imes 8 + 3$.Therefore,$5^{99} = 5^{12 	imes 8 + 3} = (5^{12})^8 	imes 5^3$.Substituting the congruence,we get $5^{99} \equiv (1)^8 	imes 5^3 \pmod{13}$.$5^3 = 125$.Now,divide $125$ by $13$: $125 = 13 	imes 9 + 8$.Thus,$125 \equiv 8 \pmod{13}$.The remainder is $8$.

The remainder obtained when $5^{99}$ is divided by $13$ is

Similar Questions

Let $n \in \mathbb{N}$. Which one of the following is true?

The remainder when $64^{32^{32}}$ is divided by $9$ is equal to .........................

Show that $9^{n+1}-8n-9$ is divisible by $64$ whenever $n$ is a positive integer.

The remainder,when $7^{103}$ is divided by $17$ is $..........$.

For all positive integers $n$,if $3(5^{2n+1}) + 2^{3n+1}$ is divisible by $k$,then the number of prime numbers less than or equal to $k$ is:

Vedclass Test Series

Exam Paper Generator

Online Exam Module