34th IMO 1993 shortlist

------
 
 
Problem 23

Show that for any finite set S of distinct positive integers, we can find a set T ⊇ S such that every member of T divides the sum of all the members of T.

 

Solution

Let S = {a1, a2, ... , ar}. Put s = ∑ ai, m = lcm(S). Suppose m = 2kn, where n is odd. Put n = bt...b1b0 in binary. Adjoin 2is for i>1 and bi=1. The adjoined numbers have sum (n-1)s, so the enlarged set has sum ns. Now adjoin ns, 2ns, 22ns, ... , 2h-1ns, where h = max(k,t). The adjoined numbers have sum (2h-1)ns, so the enlarged set T has sum 2hns. All the members of T divide the sum.

 


 

34th IMO shortlist 1993

© John Scholes
jscholes@kalva.demon.co.uk
8 Nov 2003
Last corrected/updated 8 Nov 03