Monday, December 16, 2019

I am stuck on Fermat's Little Theorem. I know how to apply it, but does it apply here 1548 mod 53.



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?



FLT problem


Answer



Since 1548 is nearly 1552, we can write



15481552154(mod53)=154,(mod53)


using Fermat's little theorem.



With the extended Euclidean algorithm, one can compute 151=7, and so
154(7)4(mod53)492(mod53)(4)2(mod53)16.(mod53)



No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...