Breaking News: Grepper is joining You.com. Read the official announcement!

python mod inverse

Bob7012 answered on April 22, 2022 Popularity 8/10 Helpfulness 7/10

answer python mod inverse

python mod inverse

Comment

def findModInverse(a, m):
  if gcd(a, m) != 1:
    return None # No mod inverse if a & m aren't relatively prime.
  u1, u2, u3 = 1, 0, a
  v1, v2, v3 = 0, 1, m
  while v3 != 0:
    q = u3 // v3
    v1, v2, v3, u1, u2, u3 = (u1 - q * v1), (u2 - q * v2), (u3 - q * v3),
    v1, v2, v3
  return u1 % m

Popularity 8/10 Helpfulness 7/10 Language python

Source: nostarch.com

Tags: inverse mod python

Link to this answer
Share Copy Link

Contributed on Apr 22 2022

Bob7012

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

python mod inverse

Contents

More Related Answers

python mod inverse

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.