Answer:
0.166666667, to round up it is 0.17
Step-by-step explanation:
 
        
             
        
        
        
Answer:
Cr = 10
Step-by-step explanation:
To calculate combinations we use the nCr formula: nCr = n! / r! * (n - r)!, where n = number of items, and r = number of items being chosen at a time.
![C(n,r)=[?]](https://tex.z-dn.net/?f=C%28n%2Cr%29%3D%5B%3F%5D)




[RevyBreeze]
 
        
                    
             
        
        
        
Answer:
0.25
Step-by-step explanation:
 
        
                    
             
        
        
        
Answer:
 isn't an equivalence relation. It is reflexive but neither symmetric nor transitive.
 isn't an equivalence relation. It is reflexive but neither symmetric nor transitive.
Step-by-step explanation:
Let  denote a set of elements.
 denote a set of elements.  would denote the set of all ordered pairs of elements of
 would denote the set of all ordered pairs of elements of  .
. 
For example, with  ,
,  and
 and  are both members of
 are both members of  . However,
. However,  because the pairs are ordered.
 because the pairs are ordered.
A relation  on
 on  is a subset of
 is a subset of  . For any two elements
. For any two elements ,
,  if and only if the ordered pair
 if and only if the ordered pair  is in
 is in  .
. 
  
A relation  on set
 on set  is an equivalence relation if it satisfies the following:
 is an equivalence relation if it satisfies the following:
- Reflexivity: for any  , the relation , the relation needs to ensure that needs to ensure that (that is: (that is: .) .)
- Symmetry: for any  , , if and only if if and only if . In other words, either both . In other words, either both and and are in are in , or neither is in , or neither is in . .
- Transitivity: for any  , if , if and and , then , then . In other words, if . In other words, if and and are both in are both in , then , then also needs to be in also needs to be in . .
The relation  (on
 (on  ) in this question is indeed reflexive.
) in this question is indeed reflexive.  ,
,  , and
, and  (one pair for each element of
 (one pair for each element of  ) are all elements of
) are all elements of  .
.
 isn't symmetric.
 isn't symmetric.  but
 but  (the pairs in
 (the pairs in  are all ordered.) In other words,
 are all ordered.) In other words,  isn't equivalent to
 isn't equivalent to  under
 under  even though
 even though  .
. 
Neither is  transitive.
 transitive.  and
 and  . However,
. However,  . In other words, under relation
. In other words, under relation  ,
,  and
 and  does not imply
 does not imply  .
.