Q.If the set has 3 elements and the set , then find the number of elements in .
The Cartesian product pairs every element of with every element of , so its size is . Here and , giving elements.
The core idea here is the Cartesian product — a way to build ordered pairs from two sets. If you have set and set , then is the set of all ordered pairs where comes from and comes from .
Why does this matter? Because the number of such pairs is simply the product of the sizes of the two sets. Think of it like a multiplication table: for each of the choices from , you have choices from to pair it with. So total pairs = .
Let’s apply this to the given problem.
-
Identify what’s given.
Set has 3 elements. We don’t know what they are — could be anything — but the count is clear: .
Set , so (three distinct numbers).
-
Apply the formula for the size of a Cartesian product.
For any two finite sets and ,
This is a direct consequence of the definition: each of the elements in pairs with each of the elements in , giving ordered pairs.
- Plug in the numbers.
A common shortcut: if you ever see “number of elements in ”, just multiply the cardinalities. No need to list pairs unless the problem asks for them.
Don’t confuse with — they are different sets (order matters in pairs), but they have the same number of elements. Also, if or had repeated elements, you’d count distinct elements only, but here both sets are given without repetition.
So the answer is straightforward.
The number of elements in is .
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.