pyspeedup/algorithms/_primes.py
def certificateOfPrimitivity(number,modulo):
    '''Generates a set of the distinct prime factors, and their least nonnegative residues of the given number in the given modulo.'''
    DIV=set(factor(modulo-1))
    RES=[]
    for i in DIV:
        RES.append(int(number**((modulo-1)/i)%modulo))
    return DIV,RES
Generates a set of the distinct prime factors, and their least nonnegative residues of the given number in the given modulo.
Generates a set of the distinct prime factors, and their least nonnegative residues of the given number in the given modulo.
Generates a set of the distinct prime factors and their least nonnegative residues of the given number in the given modulo .
def certificateOfPrimitivity(number,modulo):
    DIV=set(factor(modulo-1))
    RES=[]
    for i in DIV:
        RES.append(int(number**((modulo-1)/i)%modulo))
    return DIV,RES
def certificateOfPrimitivity ( number , modulo ) : DIV = set ( factor ( modulo - 1 ) ) RES = [ ] for i in DIV : RES . append ( int ( number ** ( ( modulo - 1 ) / i ) % modulo ) ) return DIV , RES
Generates a set of the distinct prime factors, and their least nonnegative residues of the given number in the given modulo.
Generates a set of the distinct prime factors and their least nonnegative residues of the given number in the given modulo .
'''Generates a set of the distinct prime factors, and their least nonnegative residues of the given number in the given modulo.'''
number
modulo