pyspeedup/algorithms/_divideMod.py
def divideMod(numerator,denominator,modulo):
    '''Uses the extended Euclidean algorithm to find a modular quotient.'''
    #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=_dM(numerator,denominator,modulo)
    return solution%modulo
Uses the extended Euclidean algorithm to find a modular quotient.
Uses the extended Euclidean algorithm to find a modular quotient.
Uses the extended Euclidean algorithm to find a modular quotient .
def divideMod(numerator,denominator,modulo):
    _,solution=_dM(numerator,denominator,modulo)
    return solution%modulo
def divideMod ( numerator , denominator , modulo ) : _ , solution = _dM ( numerator , denominator , modulo ) return solution % modulo
Uses the extended Euclidean algorithm to find a modular quotient.
Uses the extended Euclidean algorithm to find a modular quotient .
'''Uses the extended Euclidean algorithm to find a modular quotient.''' #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.
numerator
denominator
modulo