Let X be a set containing n elements. Two subsets A and B of X are chosen at random, the probability that `AuuB=X` is

A set contains n elements. The Power set contains

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 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 P and Q so that P cap Q = phi is :

Two non negative integers are chosen at random. The probability that the sum of the square is divisible by 10, is

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

Two positive real numbers x and y satisfying xle1 and yle1 are chosen at random. The probability that x+yle1 , given that x^2+y^2le(1)/(4) , is

A bag contains 4 tickets numbered 00, 01, 10 and 11. Four tickets are chosen at random with replacement, the probability that the sum of numbers on the tickets is 22 is

A set contains (2 n+1) elements. The number of subsets of this set containing more than n elements is equal to

A book contains 1000 pages. A page is chosen at random. Find the probability that the sum of the digits of the marked number on the page is equal to 9.

If two of the 64 squares are chosen at random on a chess board, the probability that they have a side in common is