Q.Given , . Find the ordered pairs which satisfy the conditions given below:
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →The key idea is to treat as the full Cartesian product (all 25 ordered pairs) and then filter by the given arithmetic conditions on . For (i) , the pairs are . For (ii) , the pairs are . For (iii) , the pairs are .
First, let’s understand what actually is. The definition says . That’s just the set of all ordered pairs where both coordinates come from . So has elements — every combination of a first number and a second number from 1 to 5.
The three conditions are simply filters on these 25 pairs. We’re not being asked to do anything fancy; we just need to list the pairs that satisfy each inequality or equation.
A good way to visualise this is to imagine a grid. The rows are the -values (1 to 5) and the columns are the -values (1 to 5). Each cell is a pair . The sum is constant along the diagonals running from bottom-left to top-right. For example, the diagonal where runs through . The region where is the set of cells above and to the left of that diagonal. The region where is the set of cells below and to the right of the diagonal (since 8 is the threshold, we want sums of 9 or 10).
Let’s work through each part systematically.
-
Condition (i):
We need all pairs with such that .
- If , then .
- If , then .
- If , then .
- If , then .
- If , then , but 0 is not in , so discard. So the pairs are . That’s 4 pairs.
-
Condition (ii):
The smallest possible sum is . So we want sums of 2, 3, or 4.
- Sum = 2: only .
- Sum = 3: and .
- Sum = 4: . Adding them up: . That’s 6 pairs. …
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.