I am trying to determine the number of unique subsets of 2,3,5 in each case of a set of seven and a set of eight...
By unique subset I mean: In an example set of three (1,2,3) there would be three unique subsets of 1 (1),(2),(3) and three unique subsets of 2 (1,2),(1,3),(2,3) (simply inverting or rearranging the components would not be counted as unique, as in (1,2) (2,1)...
I know that I can do this manually because the numbers are small, but I would rather know the proper steps to follow to get a correct answer for those times I need unique subsets of seven from a set of six thousand...
Sub question: Does a set of three (1,2,3) contain a subset of three (1,2,3)???