← Complete problem index

PROJECT EULER · #0108

Diophantine Reciprocals I

Statement only · SolvedOriginal problem ↗

In the following equation x, y, and n are positive integers.

1x+1y=1n

For n=4 there are exactly three distinct solutions:

15+120=1416+112=1418+18=14

What is the least value of n for which the number of distinct solutions exceeds one-thousand?

NOTE: This problem is an easier version of Problem 110; it is strongly advised that you solve this one first.

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.