🤖
@qwertyvipul | code
  • Code
  • DSA
    • Disjoint Set
    • Segment Tree
    • Bit Operations
    • Binary Exponential
    • Kadane's Algorithm
    • Modulus Multiplicative Inverse
  • Quick Notes
    • Design Patterns
    • System Design
    • React.js
  • LeetCode With JavaScript
Powered by GitBook
On this page
  • Code
  • References
  1. DSA

Modulus Multiplicative Inverse

PreviousKadane's AlgorithmNextQuick Notes

Last updated 1 year ago

Code

Recursive

def modularInverseRecursive(num, mod):
    if num == 1: return 1
    return (mod - mod // num) * modularInverse(mod % num, mod) % mod

Iterative

def modularInverseIterative(num, mod):
    for i in range(1, mod):
        if ((num % mod) * (i % mod)) % mod == 1: return i
    return -1

References

https://colab.research.google.com/drive/1FO5aWy1gRP5LLVYgPbVXLjZeymBu83ce?usp=sharing
https://www.geeksforgeeks.org/multiplicative-inverse-under-modulo-m/