计算原根python实现

调用库

• from reduced_residue_system import reducedResidueSystem
• from factorization import factorization
• from Euler_totient_function import EulerTotientFunction

主函数

from reduced_residue_system import reducedResidueSystem
from factorization import factorization
from Euler_totient_function import EulerTotientFunction

def primitiveRoot(m: int):
    try:
        int(m)
        if m < 1:
            return None
        elif m==2:
            return [1]
        else:
            phi = EulerTotientFunction(m)
            factorizationDict = factorization(phi)
            reducedResidueSystemList = reducedResidueSystem(m)
            reducedResidueSystemListPhi = reducedResidueSystem(phi)
            exponential = []
            for k in factorizationDict:
                k = int(k)
                exponential.append(phi//k)
            for r in reducedResidueSystemList:
                isPrimitiveRoot = 1
                for e in exponential:
                    if r**e % m == 1:
                        isPrimitiveRoot = 0
                        break
                if isPrimitiveRoot:
                    retList = []
                    for e in reducedResidueSystemListPhi:
                        retList.append(r**e % m)
                    return retList
            return None
    except Exception as e:
        print(e)
        return None

测试

print(primitiveRoot(2))
print(primitiveRoot(4))
print(primitiveRoot(5))
print(primitiveRoot(9))
print(primitiveRoot(41))

测试结果

[1]
[3]
[2, 3]
[2, 5]
[6, 11, 29, 19, 28, 24, 26, 34, 35, 30, 12, 22, 13, 17, 15, 7]