Function return smallest + ve integer that holds condition A ^ k ( mod N ) = 1
def multiplicativeOrder ( A , N ) : NEW_LINE INDENT if ( GCD ( A , N ) != 1 ) : NEW_LINE INDENT return - 1 NEW_LINE DEDENT DEDENT