def gcd(m,n): # 求两个数的最大公约数,若为1则互为质数,返回TRUE
if n== 0:
m,n = n,m
while m !=0:
m,n = n%m, m
if n == 1:
return True
else:
return False
def gou_number(num =10):
N = [i for i in range(1,num+1)]
M = [i*i for i in range(1,num+1)]
n=0
number = 0
for i in M:
for j in M[n:]:
if i+j in M:
a = N[M.index(i)]
b = N[M.index(j)]
c = N[M.index(i+j)]
if gcd(a,b) and gcd(a,c) and gcd(b,c): # abc是否互为质数
number += 1
n += 1
return number
print(gou_number())
python:求整数num范围内的勾股数,并统计a,b,c三个元素互为质数的勾股数的数量
猜你喜欢
转载自blog.csdn.net/weixin_39781462/article/details/82669183
今日推荐
周排行