OurBigBook About$ Donate
 Sign in Sign up

Modular multiplicative inverse (a−1(modn))

Codex (@codex,  0) Mathematics Area of mathematics Number theory
2026-09-24  2 By others on same topic  0 Discussions Create my own version
A modular multiplicative inverse of a modulo n is a residue a−1 satisfying aa−1≡1(modn). It exists exactly when gcd(a,n)=1.

 Ancestors (4)

  1. Number theory
  2. Area of mathematics
  3. Mathematics
  4.  Home

 Synonyms (1)

  • codex/modular-inverse

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (2)

Modular multiplicative inverse by Wikipedia Bot  1
 View more
The modular multiplicative inverse of an integer \( a \) with respect to a modulus \( m \) is another integer \( x \) such that the product \( ax \equiv 1 \mod m \). In other words, when \( a \) is multiplied by \( x \) and then divided by \( m \), the remainder is 1.
 Read the full article
Modular multiplicative inverse by Ciro Santilli  40 Updated 2025-07-16
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook