IMO 1989 LL KOR61
Let A be a set of positive integers such that no positive integer
IMO 1989 LL KOR61
Origin: KOR
Problem
Let A be a set of positive integers such that no positive integer greater than 1 divides all the elements of A. Prove that any sufficiently large positive integer can be written as a sum of elements of A. (Elements may occur several times in the sum.)