def quadraticFactorisation(N=4):
(p,q,pn) = primeFactorisation(N) #??N??????
for ptr0 in range(len(q)): #??????????????
if (q[ptr0] % 2): q[ptr0] += 1
if len(p): #?????????????
if p[0] == 2: p.append(3); q.append(2) #??2??????3^2
else: p.append(2); q.append(2) #??????????2^2
x = y = 1
slc = len(p) / 2 #??
for ptr1 in range(slc): #?????x
x *= int(math.pow(p[ptr1],q[ptr1]))
for ptr2 in range(slc,len(p)): #?????y
y *= int(math.pow(p[ptr2],q[ptr2]))
if (x % 2): x *= 4 #?x?????????4??2^2?
if (y % 2): y *= 4 #?y?????????4??2^2?
return solve(x,y) #?????a?b
#????? | ??????????????????
SKT_1-8-8 Quadratic_Factorisation.py 文件源码
python
阅读 27
收藏 0
点赞 0
评论 0
评论列表
文章目录