freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md

---
id: 5900f3db1000cf542c50feed
challengeType: 5
title: 'Problem 110: Diophantine Reciprocals II'
forumTopicId: 301735
---

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

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

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

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function diophantineTwo() {

  return true;
}

diophantineTwo();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

</section>