Respuesta :

The remainder when [tex]2000^1^0^0^0[/tex] is divided by 13 is 3.

What is remainder?

The amount that is "left over" after performing a calculation is referred to as the remainder in mathematics. The integer that remains after multiplying one integer by another to create an integer quotient is known as the remainder in mathematics.

We have to find the remainder when [tex]2000^1^0^0^0[/tex]  is divided by 13 .

Now clearly,

2000 = (83 x 13) + 11

So the remainder when 2000  is divided by 13  is 11 that is,

2000 ≡ 11( mod 13)

Then,

[tex]2000^1^0^0^0^[/tex] ≡  [tex]11^1^0^0^0[/tex](mod 13)             ..(1)

Now since 13  is a prime number and 13  does not divide 11 then from Fermat's little theorem we have,

[tex]11^1^3^-^1[/tex] ≡   1 mod 13)

[tex]11^1^2[/tex] ≡ 1( mod 13)

[tex]11^1^2^*^8^3[/tex] ≡  [tex]1^8^3[/tex]( mod 13)

[tex]11^1^2^*^8^3*11^4[/tex] ≡ [tex]11^4[/tex] (mod 13)                ..(2)

Now,

1000 = (83 x 12) + 4

So,

[tex]11^1^0^0^0[/tex] ≡ [tex]11^(^8^3^*^1^2^)^+^4*11^4[/tex] (mod 13)

[tex]11^1^0^0^0[/tex] ≡ [tex]11^4[/tex] (mod 13)                ..(3)       by congruence (2)

Again,

121  ≡ 4 (mod 13)

[tex]11^2[/tex] ≡ 4(mod 13)

[tex](11^2)^2[/tex] ≡ [tex]4^2[/tex] (mod 13)

[tex]11^4[/tex] ≡ 16 (mod 13)

[tex]11^4[/tex] ≡ 3 (mod 13)

So, from congruence (3) we get,

[tex]11^1^0^0^0[/tex] ≡ 3(mod 13)

Then,

[tex]2000^1^0^0^0[/tex] ≡ [tex]11^1^0^0^0[/tex] (mod 13)

[tex]2000^1^0^0^0[/tex] ≡ 3 (mod 13)

Hence, the remainder when [tex]2000^1^0^0^0[/tex] is divided by 13 is 3.

To know more about remainder, click on the link

https://brainly.com/question/25289437

#SPJ4

ACCESS MORE
EDU ACCESS
Universidad de Mexico