Call a natural number n faithful, if there exist natural numbers such that divides , divides and .
Find sum of all natural numbers which are not faithful.
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.
We'll show that the only such numbers are 1 , 2 , 3 , 4 , 5 , 6 , 8 , 1 2 , 2 4 . The sum of these is 6 5 .
First note that multiples of faithful numbers are faithful. Next note that the following numbers are faithful: 2 d + 1 1 6 1 0 = 1 + 2 + ( 2 d − 2 ) ( d ≥ 3 ) = 1 + 5 + 1 0 = 1 + 3 + 6 Let n be an unfaithful number. Write n = 2 k m where m is odd. Then the first two above identities imply that m ∈ { 1 , 3 , 5 } and k ∈ { 0 , 1 , 2 , 3 } , which leads to twelve possibilities. Three of these, n = 1 0 , 2 0 , 4 0 , are out by the third identity. It's easy to check that the other nine are unfaithful. So we are done.