Monday, 2 January 2017

number theory - Using Fermat's little theorem



I have this question:



a12772(mod71), when 0a<71



and I am having troubles getting it started.




77271 is 10 with a remainder of 62;



How do I do this question?


Answer



12772=127110+621210+62=1271+11212=1442 mod 71. So a=2.



Alternately,



12772=127011+2122=1442 mod 71.




The first one uses the form apa mod p and the second uses the form ap11 mod p if gcd(a,p)=1 where p is prime.


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...