The question simply asks primitive pythagorean triples ##(a,b,c)## such that ##S = a + b + c <15\times 10^{5}##
import time
import math
start = time.perf_counter()
pythagorean_triples = {(3, 4, 5) : 12}
for m in range(0, 10**3, 2):
for n in range(1, m, 2):
if math.gcd(m, n) == 1...