Faithful numbers

Call a natural number n faithful, if there exist natural numbers a < b < c a<b<c such that a a divides b b , b b divides c c and n = a + b + c n=a+b+c .

Find sum of all natural numbers which are not faithful.

This is a INMO problem.


The answer is 65.

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

Patrick Corn
Jun 5, 2015

We'll show that the only such numbers are 1 , 2 , 3 , 4 , 5 , 6 , 8 , 12 , 24 1,2,3,4,5,6,8,12,24 . The sum of these is 65 \fbox{65} .

First note that multiples of faithful numbers are faithful. Next note that the following numbers are faithful: 2 d + 1 = 1 + 2 + ( 2 d 2 ) ( d 3 ) 16 = 1 + 5 + 10 10 = 1 + 3 + 6 \begin{aligned} 2d+1 &= 1+2+(2d-2) \quad (d \ge 3) \\ 16 &= 1+5+10 \\ 10 &= 1+3+6 \\ \end{aligned} Let n n be an unfaithful number. Write n = 2 k m n = 2^k m where m m is odd. Then the first two above identities imply that m { 1 , 3 , 5 } m \in \{ 1,3,5 \} and k { 0 , 1 , 2 , 3 } k \in \{ 0,1,2,3 \} , which leads to twelve possibilities. Three of these, n = 10 , 20 , 40 , n = 10,20,40, are out by the third identity. It's easy to check that the other nine are unfaithful. So we are done.

I couldn't get the solution could you elaborate more. Like, how you got the general form of n. Thanks.

Grijesh Agrawal - 5 years, 8 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...