I have this question:
a≡12772(mod71), when 0≤a<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=1271⋅10+62≡1210+62=1271+1≡12⋅12=144≡2 mod 71. So a=2.
Alternately,
12772=1270⋅11+2≡122=144≡2 mod 71.
The first one uses the form ap≡a mod p and the second uses the form ap−1≡1 mod p if gcd(a,p)=1 where p is prime.
No comments:
Post a Comment