Let t(A) denote the sum of elements of a nonempty set A of integers, and define t(∅)=0. Find a set X of positive integers such that for every integers k there is a unique ordered pair of disjoint subsets (Ak,Bk) of X such that t(Ak)−t(Bk)=k. inductioncombinatorics unsolvedcombinatorics