Respuesta :

Your question translates to computing [tex]3^{2020} \pmod {13}[/tex].

Recall Euler's theorem: if [tex]\gcd(a,n)=1[/tex] (that is, [tex]a[/tex] and [tex]n[/tex] are relatively prime), then [tex]a^{\varphi(n)}\equiv1\pmod n[/tex], where [tex]\varphi(n)[/tex] denotes Euler's totient function, which counts the number of positive integers relatively prime to [tex]n[/tex].

Since 13 is prime, we have [tex]\phi(13)=12[/tex]. Then by Euler's theorem,

[tex]3^{12} \equiv 1 \pmod{13}[/tex]

Now, observe that 2020 = 168×12 + 4, so that

[tex]3^{2020} \equiv 3^{168\times12+4} \equiv \left(3^{12}\right)^{168} \times 3^4 \equiv 1^{168} \times 3^4 \equiv 3^4 \pmod{13}[/tex]

and since 3⁴ = 81 = 6×13 + 3, we end up with

[tex]3^{2020} \equiv 81 \equiv 3 \pmod{13}[/tex]

so the remainder upon dividing 3²⁰²⁰ by 13 is 3.

ACCESS MORE