freeCodeCamp/problem-142-perfect-square-collection.english.md at 908adc2c372f2c1af0c8d1c80b264c23f96fd7d7

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

815 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f3fa1000cf542c50ff0d	5	false	Problem 142: Perfect Square Collection	301771

Description

Find the smallest x + y + z with integers x > y > z > 0 such that x + y, x − y, x + z, x − z, y + z, y − z are all perfect squares.

Instructions

Tests

tests:
  - text: <code>euler142()</code> should return 1006193.
    testString: assert.strictEqual(euler142(), 1006193);

Challenge Seed

function euler142() {
  // Good luck!
  return true;
}

euler142();

Solution

// solution required

815 B Raw Blame History Unescape Escape