---
id: 5900f3db1000cf542c50feed
challengeType: 5
title: 'Problem 110: Diophantine Reciprocals II'
forumTopicId: 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
```yml
tests:
- text: diophantineTwo() should return 9350130049860600.
testString: assert.strictEqual(diophantineTwo(), 9350130049860600);
```
## Challenge Seed
```js
function diophantineTwo() {
return true;
}
diophantineTwo();
```