Monday, December 5, 2016

Fractions in Modular Arithmetic


Suppose we have 23xmod5


I understand that the first step that needs to be made is: 23xmod5


But from there I'm having a hard time understanding the logic of how to solve for x. Obviously, with simple numbers like this example, the answer is 4, but how can I abstract the process to solve for x when the numbers become very large?


Answer



Modulo arithmetic generally deals with integers, not fractions. Instead of division, you multiply by the inverse. For instance, you would not have 23xmod5, you would have 231xmod5. In this case, 312mod5, so you would have 224mod5. The inverse of a number a in modular arithmetic is the number a1 such that aa11modn.


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...