Consider the set of all 10-digit numbers expressible with the help of figures 1 and 2 only. Divide it into two subsets so that the sum of any two numbers of the same subset is a number which is written with not less than two 3’s. number theorycombinatoricsSubsetSum10-digit