Problem 9
Solution to Problem 9. Written in Python.
Problem: A Pythagorean triplet is a set of three natural numbers, a < b < c, for which, a2 + b2 = c2. For example, 32 + 42 = 9 + 16 = 25 = 52. There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the product abc.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| my_range = xrange(1, 1001) | |
| cross_product = [[x, y] for x in my_range for y in my_range] | |
| for [x, y] in cross_product: | |
| a = pow(x, 2) - pow(y, 2) | |
| b = 2 * x * y | |
| c = pow(x, 2) + pow(y, 2) | |
| if(a + b + c == 1000): | |
| product = a * b * c | |
| if product > 0: | |
| print str(product) | |
| break |