Normally, set x is considered equal to set y if x={A,B} and y={B,A}. However, for my question let's assume {A,B} = {B,A} is NOT true because of the sequence of their members. We have a set c with n number of unique elements. How many subsets can there be for the set c if:
*{A,B} and {B,A} are not considered equal or same
*Each subset has maximum two elements
*An element is not repeated in the subset
Is there any specific term for above mentioned phenomenon?
2007-12-05
17:53:54
·
3 answers
·
asked by
szhob
3