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

Files

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

1.1 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f3db1000cf542c50feed	5	false	Problem 110: Diophantine Reciprocals II	301735

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);

Challenge Seed

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

diophantineTwo();

Solution

// solution required

1.1 KiB Raw Blame History