Problem:
2. Call a natural number faithful, if there exist natural numbers such that divides , divides and .
(i) Show that all but a finite number of natural numbers are faithful.
(ii) Find the sum of all natural numbers which are not faithful.
Problem:
2. Call a natural number faithful, if there exist natural numbers such that divides , divides and .
(i) Show that all but a finite number of natural numbers are faithful.
(ii) Find the sum of all natural numbers which are not faithful.
Solution:
Suppose is faithful. Let and consider . Since , with , and , we see that which shows that is faithful.
Let be a prime. Then is odd and shows that is faithful. If contains a prime factor , then the above observation shows that is faithful. This shows that a number which is not faithful must be of the form . We also observe that , and , so that , and are faithful. Hence is also faithful if it contains a factor of the form where ; a factor of the form where ; or a factor of the form where . Thus the numbers which are not faithful are of the form , where , and . We may enumerate all such numbers:
Among these , , , , , , and . It is easy to check that the other numbers cannot be written in the required form. Hence the only numbers which are not faithful are
Their sum is .
Solution:
If with is faithful, we see that , and . Hence . Thus are not faithful. As observed earlier, is faithful whenever is. We also notice that for odd , we can write so that all odd are faithful. Consider , where is odd. By observation, they are all faithful. Let us list a few of them:
We observe that and hence it is faithful. Thus all multiples of are also faithful. Thus we see that are faithful. Any even number which is not a multiple of must be either an odd multiple of , or that of , or that of . Hence, the only numbers not covered by this process are . Of these, we see that
so that are faithful. Thus the only numbers which are not faithful are
Their sum is .