Finn Hulse is doodling in his notebook, and decides to coin a new term.

A three-digit number \(\overline{abc}\), where \(a,b,c\) are digits, is said to be a *Finn-umber* if it follows the following conditions:

\(\overline{ab}\) is divisible by some natural number \(n\), and \(\overline{bc}\) is divisible by \(n\)

\(\overline{abc}\) as a three digit number must not be divisble by \(n\)

Finn took two random Finn-umbers, \(x, y\), and subtracted them, and found that the result itself was another Finn-umber, say \(z\).

Now, find the sum of the maximum values of \(x\) and \(y\), which would give the least possible value of \(z\).

×

Problem Loading...

Note Loading...

Set Loading...