752
772
792
782
Step 1: Find the total number of elements in \(A \times B\).
- The Cartesian product \(A \times B\) contains \(n(A) \times n(B) = 5 \times 2 = 10\) elements.
Step 2: Calculate the subsets.
- The total number of subsets of \(A \times B\) is \(2^{10} = 1024\).
- Subsets with at least 3 and at most 6 elements are given by: \[ \binom{10}{3} + \binom{10}{4} + \binom{10}{5} + \binom{10}{6}. \] - Calculate each term: \[ \binom{10}{3} = 120, \quad \binom{10}{4} = 210, \quad \binom{10}{5} = 252, \quad \binom{10}{6} = 210. \] - Summing these: \[ 120 + 210 + 252 + 210 = 792. \] Final Answer: The number of subsets is \(792\).
Let one focus of the hyperbola $ \frac{x^2}{a^2} - \frac{y^2}{b^2} = 1 $ be at $ (\sqrt{10}, 0) $, and the corresponding directrix be $ x = \frac{\sqrt{10}}{2} $. If $ e $ and $ l $ are the eccentricity and the latus rectum respectively, then $ 9(e^2 + l) $ is equal to:
The largest $ n \in \mathbb{N} $ such that $ 3^n $ divides 50! is:
Relation is said to be empty relation if no element of set X is related or mapped to any element of X i.e, R = Φ.
A relation R in a set, say A is a universal relation if each element of A is related to every element of A.
R = A × A.
Every element of set A is related to itself only then the relation is identity relation.
Let R be a relation from set A to set B i.e., R ∈ A × B. The relation R-1 is said to be an Inverse relation if R-1 from set B to A is denoted by R-1
If every element of set A maps to itself, the relation is Reflexive Relation. For every a ∈ A, (a, a) ∈ R.
A relation R is said to be symmetric if (a, b) ∈ R then (b, a) ∈ R, for all a & b ∈ A.
A relation is said to be transitive if, (a, b) ∈ R, (b, c) ∈ R, then (a, c) ∈ R, for all a, b, c ∈ A
A relation is said to be equivalence if and only if it is Reflexive, Symmetric, and Transitive.