Russkiygus2590 Russkiygus2590
  • 02-03-2018
  • Mathematics
contestada

Using fermat's little theorem, find the least positive residue of $2^{1000000}$ modulo 17.

Respuesta :

mathmate
mathmate mathmate
  • 02-03-2018
Fermat's little theorem states that
[tex]a^p[/tex]≡a mod p

If we divide both sides by a, then
[tex]a^{p-1}[/tex]≡1 mod p
=>
[tex]a^{17-1}[/tex]≡1 mod 17
[tex]a^{16}[/tex]≡1 mod 17

Rewrite
[tex]a^{1000000}[/tex] mod 17  as
[tex]=(a^{16})^{62500}[/tex] mod 17
and apply Fermat's little theorem
[tex]=(1)^{62500}[/tex] mod 17
=>
[tex]=(1)[/tex] mod 17

So we conclude that
[tex]a^{1000000}[/tex]≡1 mod 17

Answer Link

Otras preguntas

Emperor Wudi served as emperor of the Han Dynasty in China from 141 B.C. until 87 B.C. He changed the way people were appointed to government jobs by A. using
Your brother tells you a secret. You see no harm in telling two friends. After this second "passing" of the secret, 4 people now know the secret (your brother,
Order the set of numbers from least to greatest. {63, -34, 36, -27, -13, and 12} ​
Kisha saved $12.00 when buying a coat. The coat was on sale for 30% off. What was the original price of the coat?
Simplify. 34−4x+12x−12+12x Enter your answer in the box. Do not use decimals in your answer.
Factorise the following: x^2-14x+48
PLEASE HELP QUICKLY AS POSSIBLE THANK YOU :) ​
22 divided by 6 equals
HELP A GIRL OUTT PLEASEE Which phrase is associated with asexual reproduction but not sexual reproduction? A. Genetically different offspring B. Genetically ide
Helppp help help help help ASAP help plz