pyspeedup/algorithms/_invMod.py
def invMod(number,modulo):
    '''Uses the extended Euclidean algorithm to deduce the inverse of 'number' mod 'modulo'.'''
    #Since the quotient values are used in reverse order, postfix recursion makes sense for this equation.
    # The following recursively uses Euclidean divison, then applies the tabular algorithm upon returning.
    _,solution=_iM(modulo,number)
    return solution%modulo
Uses the extended Euclidean algorithm to deduce the inverse of 'number' mod 'modulo'.
Uses the extended Euclidean algorithm to deduce the inverse of 'number' mod 'modulo'.
Uses the extended Euclidean algorithm to deduce the inverse of ' number ' mod ' modulo ' .
def invMod(number,modulo):
    _,solution=_iM(modulo,number)
    return solution%modulo
def invMod ( number , modulo ) : _ , solution = _iM ( modulo , number ) return solution % modulo
Uses the extended Euclidean algorithm to deduce the inverse of 'number' mod 'modulo'.
Uses the extended Euclidean algorithm to deduce the inverse of ' number ' mod ' modulo ' .
'''Uses the extended Euclidean algorithm to deduce the inverse of 'number' mod 'modulo'.''' #Since the quotient values are used in reverse order, postfix recursion makes sense for this equation. # The following recursively uses Euclidean divison, then applies the tabular algorithm upon returning.
number
modulo