Skip to content
START WITH A QUESTION

What would you like to understand?

Find an answer. See the moment it becomes clear. Follow the idea further.

← Concept directory

Answers for “如何使用加模数法手动找到模逆元?”

2 keyword matches

Understanding your question. You can explore the search results below now.

Meet the concept

↗

Two integers a and b are multiplicative inverses modulo m if their product is congruent to 1 modulo m. This is defined by the condition ab≡1(modm)ab \equiv 1 \pmod{m}.

Conditions: a and b are integers.; The congruence is taken modulo m.

Meet the concept

↗

The inverse of 5 modulo 7 is 3. It is computed using the add-the-modulus method: start with 1, add 7 to get 8 (not a multiple of 5), add 7 again to get 15.

Conditions: Modulus is 7.; Target integer is 5.