GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaScript/Project-Euler/Problem009.js at master · Algorithms-Learn/JavaScript Expand file tree/ Copy pathProblem009.jsMore file actions 26 lines (21 loc) · 661 Bytes / Copy pathProblem009.jsFile metadata and controls26 lines (21 loc) · 661 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 /* Special Pythagorean triplet A Pythagorean triplet is a set of three natural numbers, a < b < c, for which, a^2 + b^2 = c^2 For example, 32 + 42 = 9 + 16 = 25 = 52. There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the product abc. */ const isPythagoreanTriplet = (a, b, c) => Math.pow(a, 2) + Math.pow(b, 2) === Math.pow(c, 2) export const findSpecialPythagoreanTriplet = () => { for (let a = 0; a < 1000; a++) { for (let b = a + 1; b < 1000; b++) { for (let c = b + 1; c < 1000; c++) { if (isPythagoreanTriplet(a, b, c) && a + b + c === 1000) { return a * b * c } } } } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |