freeCodeCamp/problem-110-diophantine-reciprocals-ii.english.md at aaba2298bf235cff66c10637bb3be0e326c7959f

Files

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.1 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f3db1000cf542c50feed	5	Problem 110: Diophantine Reciprocals II

Description

In the following equation x, y, and n are positive integers. 1/x + 1/y = 1/n It can be verified that when n = 1260 there are 113 distinct solutions and this is the least value of n for which the total number of distinct solutions exceeds one hundred. What is the least value of n for which the number of distinct solutions exceeds four million?

Instructions

Tests

tests:
  - text: <code>diophantineTwo</code> should return 9350130049860600.
    testString: assert.strictEqual(diophantineTwo(), 9350130049860600, '<code>diophantineTwo()</code> should return 9350130049860600.');

Challenge Seed

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

diophantineTwo();

Solution

// solution required

1.1 KiB Raw Blame History