# How to explain inverse modulo? [closed]

Do you know a (simple) inverse modulo calculator somewhere on the Internet?

How to explain simply inverse modulo? (when the concept of modulo is already a bit known)

How to explain someone how to find a calculation resulting with a given modulo? For instance, finding a calculation with a modulo = 5.

## closed as off-topic by Chris Cunningham♦, Brendan W. Sullivan, JTP - Apologise to Monica, kcrisman, Amy BMay 20 '17 at 17:41

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is off-topic because it is a mathematical question as contrasted with a question about mathematics education. For a Stack Exchange site for mathematical questions please see Mathematics." – Chris Cunningham, Brendan W. Sullivan, JTP - Apologise to Monica, kcrisman, Amy B
If this question can be reworded to fit the rules in the help center, please edit the question.

• I'm not sure this is a good question for this site since it asks a question about how to calculate something instead of a question about mathematics education; you can find inverses modulo $n$ with the Euclidean Algorithm. See for example the "Extended Euclidean Algorithm" section at en.wikipedia.org/wiki/Modular_multiplicative_inverse – Chris Cunningham May 16 '17 at 16:50
• And how to explain also... But do you think I should move my question? – Quidam May 17 '17 at 10:03

a = Mod(3,7)

This gives 4 and 5, respectively.