Divide et impera asked to divide the set of integers from 1 to 15 into two subsets A & B,
so that the sum of the numbers in A equals the product
of the numbers in B.

Instead of an upper limit of 15, use n to stand for any positive integer.

Find, with proof for what values of n the task is possible?