I can't seem to figure out this problem. I can factor to reduce the number, but this is too time consuming. Isn't FLT suppose to help here?
Can someone provide clarification please?
Answer
Since 1548 is nearly 1552, we can write
1548≡1552⋅15−4(mod53)=15−4,(mod53)
using Fermat's little theorem.
With the extended Euclidean algorithm, one can compute 15−1=−7, and so
15−4≡(−7)4(mod53)≡492(mod53)≡(−4)2(mod53)≡16.(mod53)
No comments:
Post a Comment