Number of elements in cartesian product of sets Theorem (If A and B are two finite sets then ;`(n(AxxB))=n(A)xxn(B)`

If A and B are two sets, then n(A)+ n(B) is equal to

If A and B are finite sets with n(A) =3 and N(B)=6 then find n(AxxB)

If A;B and C are finite sets and U be the universal set then n(A-B)=n(A)-n(A nn B)

Two finite sets have m and n elements.The number of elements is the power set of first set is 48 more than the power set of second set.Then (m,n)=

If n(A) denotes the number of elements in set A and if n(A) = 4, n(B) = 5 and n(A nn B) =3 then n[(A xx B) nn (B xx A)]=

If A;B and C are finite sets and U be the universal set then n(A'nn B')=n((A uu B)')=n(U)-n(A uu B)

If A;B and C are finite sets and U be the universal set then n(A'uu B')=n((A nn B)')=n(U)-n(A nn B)

Two finite sets have m and n elements. The number of elements in the power set of first set is 48 more than the total number of elements in the power set of the second set. Then the value of m and n are-

A and B are finite sets. 3n(A)=4n(B)=2n (AuuB) and n(AnnB)=12 then n(AuuB)=

If x is a finite set. Let P(X) denote the set of all subsets of X and let n(X) denote the number of elements in X. If for two finite subsets A, B, n(P(A)) = n(P(B)) + 15 then n(B) = , n(A) = 6,2 8,4 4,0 0,1