We consider S a set of odd positive interger numbers with n≥3 elements such that no element divides another element. We say that a set S is beautiful if for any 3 elements from S, there is one the divides the sum of the other 2. We call a beautiful set S maximal if we can't add another number to the set such that S will still be beautiful. Find the values of n for which there exists a maximal set. Problem Setscombinatorics