Themed Challenge 5 (Finn Hulse): Finn-umbers!

Logic Level 4

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

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

  1. a b \overline{ab} is divisible by some natural number n n , and b c \overline{bc} is divisible by n n

  2. a b c \overline{abc} as a three digit number must not be divisble by n n

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

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


The answer is 1887.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

First, we have to find the smallest Finnumber. First, consider a b = 10 ab=10 . Here, the value of n n can be either 1 , 2 , 5 1,2,5 , or 10 10 , as n n must divide a b ab . However, it must be noted that n n can never be 1 1 , as n n would always divide a b c abc . Also, n n cannot be 2 , 4 2, 4 , as b c bc would be divisible by 2 2 or 4 4 , then so would a b c abc . Also, n n cannot be equal to 5 5 because c c would have to be either 5 5 or 0 0 , and then a b c abc would be divisible by n n . In this case, if n = 10 n=10 , then b c bc must be 00 00 . But, 10 10 divides 100 100 . Thus, there are no Finnumbers from 100 109 100-109 .

Now, if a b = 11 ab=11 , then n = 11 n=11 . Thus, b c bc must be 11 11 , and a b c = 111 abc=111 , which is not divisible by 11 11 . Thus, the smallest Finnumber is 111 111 . Thus, to minimize z z , z = 111 z=111 . Now to maximize x x , we must check if x x can be the largest Finnumber. Now, the largest three-digit number is 999 999 , which is a Finnumber, with n = 99 n=99 . Now, if x = 999 x=999 , then y y must be 888 888 . After checking it is found that 888 888 is actually a Finnumber, with n = 88 n=88 . Now, that the maximums of x , y x,y are obtained, x + y = 999 + 888 = 1887 x+y=999+888=\boxed{1887}

Aww nartz I failed and got 121 = 484 363 121=484-363 and got it wrong. But I'm very happy to see such a marvelous problem! I think it needs to be specified that n 1 n \neq 1 , though. Otherwise, fantastic job! :D

Finn Hulse - 7 years ago

Log in to reply

Thanks! Actually, n n can be 1 1 , but then a b c abc wouldn't be a Finnumber.

You should copyright that.

Log in to reply

Oh wait you're right. :D

Finn Hulse - 7 years ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...