solve_p

'''
for i in range(n):
    e[i] += 1
M = IntegerMatrix(n*(n-1)//2,n)
cnt = 0
for i in range(n):
    for j in range(i+1, n):
        for k in range(n):
            if k == i:
                M[cnt,k] = e[j]
            elif k == j:
                M[cnt,k] = -e[i]
            else:
                M[cnt,k] = 0
        cnt += 1
print("LLL Reduction... ",end='')
LLL.reduction(M)
print("Done!")
b1 = M[-n+1]
b2 = M[-n+2]
print("b1 =",b1)
print("b2 =",b2)'''
b1 = (114, -155, -86, 105, 18, 85, -52, 226, 125, -97, -215, -72, -18, -146, -92, 160, -138, 69, -48, -15, -78, -42, -77, -121, 42, 145, -130, -72, -43, -176, -39, -4, -10, -100, -60, 87, 215, 44, 254, -179, -23, 121, -289, 151, -47, 14, -33, -97, 164, -157, 31, 204, 226, -177, 208, 14, 130, -38, 11, 103, 32, -29, 0, 0)
b2 = (157, 110, -56, -87, -83, -76, 59, 266, 13, 33, -49, 29, -85, 207, 118, 4, -77, 148, 59, -136, 63, 212, 99, 12, 227, 118, -86, -35, -130, -194, -200, 110, -53, -203, -21, -39, 32, -186, 3, -42, 29, -230, -34, 142, -78, -107, -108, 17, 251, -127, -31, 189, -47, 48, -192, -280, 29, -70, -91, 40, -28, -15, 20, 0)
n1 = 1
n2 = 1
p1 = 1
p2 = 1
for i in range(64):
    if b1[i] < 0:
        n1 *= pow(c[i], -b1[i])
    else:
        p1 *= pow(c[i], b1[i])

    if b2[i] < 0:
        n2 *= pow(c[i], -b2[i])
    else:
        p2 *= pow(c[i], b2[i])
sum1 = abs(p1-n1)
sum2 = abs(p2-n2)
print("Finish Counting sum1 sum2!")

def GCD(a, b):
    while b:
        a, b = b, a%b
    return a
p = GCD(sum1, sum2)
print("Found p =",p)