Does there exist a set of 1992 positive integers such that each subset has a sum which is a square, cube or higher power?
Answer
Yes.
Solution
We show that given any positive integer n, we can find a positive integer d such that d, 2d, 3d, ... , nd are all squares or higher powers. We use induction on n. n = 1 is trivial. Suppose the result is true for n, so d = m1k1, 2d = m2k2, ... , nd = mnkn. Put k = lcm(k1, k2, ... kn), D = d(n+1)kdk. Then D certainly works for 1, 2, ... , n. But it also works for n+1: (n+1)D = ((n+1)d)k+1. So the result is true for n+1 and hence for all n.
So take d for n = 1+2+3+...+1992. Then the set {d, 2d, 3d, ... , 1992d} meets the requirements.
© John Scholes
jscholes@kalva.demon.co.uk
25 Nov 2003
Last updated/corrected 25 Nov 2003