freeCodeCamp/problem-108-diophantine-reciprocals-i.english.md at c752d57611608020b336e732b54b14e95ae6025c

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.0 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f3d91000cf542c50feeb	5	Problem 108: Diophantine Reciprocals I

Description

In the following equation x, y, and n are positive integers. 1/x + 1/y = 1/n For n = 4 there are exactly three distinct solutions: 1/5 + 1/20 = 1/4
1/6 + 1/12 = 1/4
1/8 + 1/8 = 1/4 What is the least value of n for which the number of distinct solutions exceeds one-thousand?

Instructions

Tests

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

Challenge Seed

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

diophantineOne();

Solution

// solution required

1.0 KiB Raw Blame History