A is a set containing n elemments. A subset `P_(1)` of A is chosen. The set A is reconstructed by replacing the elements of `P_(1)`. Next, a subset `P_(1)` to `A` is chosen and againn the set is reconstructed by replacing the elements of `P_(2)`. In this way `m(gt1)` subsets `P_(1),P_(2), . ..,P_(m)` of A are chosen. find the number of ways of choosing `P_(1),P_(2), . . .,P_(m)`, so that
`P_(1)capP_(2)capP_(3)cap . .. cap P_(m)=phi`

A is a set containing n elements. A subset P_1 of A is chosen. The set A is reconstructed by replacing the elements of P_1 . Then a subset P_2 of A is chosen and again the set A is constructed by replaing the elements of P_2. Again a subset P_3 of A is chosen.

A is a set containing n elements. A subset P_1 of A is chosen. The set A is reconstructed by replacing the elements P Next, a of subset P_2 of A is chosen and again the set is reconstructed by replacing the elements of P_2 , In this way, m subsets P_1, P_2....,P_m of A are chosen. The number of ways of choosing P_1,P_2,P_3,P_4...P_m

A is a set containing n elements. A subset P_1 of A is chosen. The set A is reconstructed by replacing the elements of P_1 . Then a subset P_2 of A is chosen and again the set A is constructed by replaing the elements of P_2. Again a subset P_3 of A is chosen. One thebasis of above informastionn answere the following question: Number of ways of choosing P_1,P_2,

A is a set containing n elements. A subset P_1 of A is chosen. The set A is reconstructed by replacing the elements of P_1 . Then a subset P_2 of A is chosen and again the set A is constructed by replaing the elements of P_2. Again a subset P_3 of A is chosen. One thebasis of above informastionn answere the following question:Number

A is a set containing n elements. A subset P of A is chosen at random. The set A is reconstructed by replacing the elements of P. A subset Q is again chosen at random. The probability that P =Q, is

A is a set containing n elements. A subset P of A is chosen at random. The set A is reconstructed by replacing the elements of P. A subset Q is again chosen at random. The Probability that P cup Q=A , is

P is a set containing n elements . A subset A of P is chosen and the set P is reconstructed by replacing the element of A. B such that A and B have no common elements, is

A is a set containing n elements . A subet P of A is chosen at random. The set A is reconstructed by replacing the elements of P.A subet Q is again chosen at random. The number of ways of selecting P and Q, is .

A is a set containing n elements. A subset P of A is chosen. The set A is reconstructed by replacing the elements of P. A subset Q of A is again chosen, the number of ways of choosing so that (P cup Q) is a proper subset of A, is

A class of problems that requires one to use permutations and combinations for computing probability has at its heart notion of sets and subsets. They are generally an abstract formulation of some concrete situation and require the application of counting techniques. A is a set containing 10 elements. A subset P_(1) of A is chosen and the set A is chosen and the set A is reconstructed by replacing the elements of P_(1) . A subset P_(2) of A is chosen and again the set A is reconstructed by replacing the elements of P_(2) . This process is continued by choosing subsets P_(1), P_(2), ... P_(10) . The number of ways of choosing subsets P_(1), P_(2),...P(10) is