|
Project Euler Solutions
|
Functions | |
| def | triples () |
| def | main () |
Project Euler Problem 9 My triples() function is definitely pythonic, but I don't know if it is all that efficient. I feel like I could do better. Problem: A Pythagorean triplet is a set of three natural numbers, a < b < c, for which, a**2 + b**2 = c**2 For example, 3**2 + 4**2 = 9 + 16 = 25 = 5**2. There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the product abc.
| def python.p0009.main | ( | int | ) |

| def python.p0009.triples | ( | Iterator, | |
| Tuple, | |||
| int, | |||
| int, | |||
| int | |||
| ) |

1.8.11