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

I don't understand please help ​
True or False: The measure of the slant of a line is called its slope
Explain the rebates system used by the railroads and its affect on small farmers.
need an answer thanks​
How many people in us watch super ball
PLEASE HELP 20 POINTS multiply and simplify. -3x^2y^2*y^4x^3
please solve will give brainliest
Y’all I need some help!! It would be greatly appreciated:) What are some limits associated with the use of normals?
The common stock of the c.a.l.l. corporation has been trading in a narrow range around $140 per share for months, and you believe it is going to stay in that ra
Nicole has 17 nickels n and dimes d. If the value of her coins is $1.30, how many of each coin does she have?