feat(day 159): check if right triangle hypotenuse is an integer using Pythagorean theorem

Author: JohnSunny21

FreeCodeCamp/CodingQ/IntegerHypotenuse.py

@@ -0,0 +1,46 @@
+"""  
+
+Integer Hypotenuse
+Given two positive integers representing the lengths for the two legs (the two short sides) of a right triangle, determine whether the hypotenuse is an integer.
+
+The length of the hypotenuse is calculated by adding the squares of the two leg lengths together and then taking the square root of that total (a2 + b2 = c2).
+"""
+
+import math, unittest
+
+class IntegerHypotenuseTest(unittest.TestCase):
+
+    def test1(self):
+        self.assertEqual(is_integer_hypotenuse(3, 4), True)
+
+    def test2(self):
+        self.assertEqual(is_integer_hypotenuse(2, 3), False)
+
+    def test3(self):
+        self.assertEqual(is_integer_hypotenuse(5, 12), True)
+
+    def test4(self):
+        self.assertEqual(is_integer_hypotenuse(10, 10), False)
+
+    def test5(self):
+        self.assertEqual(is_integer_hypotenuse(780, 1040), True)
+
+    def test6(self):
+        self.assertEqual(is_integer_hypotenuse(250, 333), False)
+
+
+def is_integer_hypotenuse(a, b):
+    
+    c = math.sqrt(a**2 + b**2)
+
+    return c.is_integer()
+
+
+"""
+=> This is essentially checking if (a, b, c) form a Pythagorean triple.
+=> .is_integer() in Python or Number.isInteger() in JS ensures the hypotenuse is a whole number.
+=> Example of integer hypotenuses: (3, 4, 5), (5, 12, 13), (8, 15, 17).
+"""
+if __name__ == "__main__":
+    print(is_integer_hypotenuse(3, 4))
+    unittest.main()

FreeCodeCamp/CodingQ/PythagoreanTriple.py

@@ -0,0 +1,37 @@
+"""  
+A Pythagorean triple is a set of integers (a, b, c) such that: a^2 + b^2 = c^2
+
+where c is the hypotenuse.
+
+We want all triples with c <= N.
+"""
+
+import math
+
+def pythagorean_triples(limit):
+
+    triples = []
+    for a in range(1, limit):
+        for b in range(a, limit):
+
+            c2 = a*a + b*b
+            c = int(math.isqrt(c2))
+
+            if c*c == c2 and c <= limit:
+                triples.append((a, b, c))
+
+    return triples
+
+
+
+"""  
+=> We loop over possible legs a and b.
+=> Compute c2 = a2 + b2
+=> If c2 is a perfect square, we've found a triple.
+=> Restrict c <= limit.
+=> This finds primitive triples (like (3, 4, 5)) and multiples (like (6,8, 10))
+"""
+
+if __name__ == "__main__":
+
+    print(pythagorean_triples(20))