I want to find all the different combinations of dividing 17 into 2 groups; the order does not matter; each group has to contain at least one item.
I know the formula is C(17,r)=17!/(r!*(17-r)!) and my r is one to eight so there's a lot! I hoping there is an easy way to do this. I have been trying to assign items into the two groups by using 1 and 0 - i.e. 01111111111111111, 10111111111111111, 11011111111111111, ... 00111111111111111, 01011111111111111, etc ...