0%

Problem 108


Problem 108


Diophantine Reciprocals I

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=14 16+112=14 18+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.


丢番图倒数(一)

在如下方程中,xyn均为正整数:

1x+1y=1n

对于n=4,上述方程恰好有三个不同的解:

15+120=14 16+112=14 18+18=14

最小的使得不同的解的数目超过1000n是多少?

注意:这个问题是第110题的简单版本;强烈建议读者先解决这一题。


Gitalking ...