A set containing n elements. A subset P of A is chosen. The set A is reconstructed by replacing the element of P. A subset Q of A is again chosen the number of ways of choosing P and Q so that P∩Q=ϕ is
A
2n−2nCn
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
2n
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
2n−1
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
3n
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
Open in App
Solution
The correct option is D3n Let A= {a1,a2...,an} For each a1∈A(1≤i≤n) we have the following four cases i)ai∈P and ai∈Q ii)ai∉Pandai∈Q iii)ai∈Pandai∉Q iv)ai∉Pandai∉Q Thus, the total number of ways of choosing P and Q is 4n. Out of these four choices, (i) is not favourable for P∩Q=Q Thus, the number of ways =3n.