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

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

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

If A and B are two finite sets,then prove that n(A uu B)=n(A)+n(B)-n(AnnB)

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

If A and B are two finite sets such that A nn B != phi , then n (A uu B) =

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) =

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)=

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 power set of the second set. Then the value of m and n are………..

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)