The Geometry of Symmetry
A Journey into Relations
Welcome, fellow traveler of the mathematical landscape. Today, we are going to peel back the layers of a problem that, at first glance, seems like a simple exercise in counting.
But beneath the surface of these algebraic relations lies a beautiful geometric truth: the concept of symmetry.
Imagine the set X={1,2,3,…,20} as a vast, discrete grid. Every relation we define on this set is essentially a collection of points on this grid.
When we talk about a relation being 'symmetric,' we are talking about a mirror. If you place a mirror along the line y=x, every point (x,y) in your relation must have a corresponding reflection (y,x) on the other side.
If that reflection is missing, the relation is 'broken'—it lacks symmetry. Our job today is to fix these broken relations by adding the minimum number of points required to complete the reflection.
Unmasking R1
The Parity Puzzle
Let us look at R1={(x,y):2x−3y=2}. This is not just an equation; it is a constraint on the existence of points.
We can rewrite this as 2x=3y+2. Immediately, our mathematical intuition should fire: 2x is always even. Therefore, 3y+2 must also be even.
For 3y+2 to be even, 3y must be even, which forces y to be an even number. We test our values of y within the set X:
- If y=2, 2x=8⟹x=4. We have the point (4,2).
- If y=4, 2x=14⟹x=7. We have the point (7,4).
- If y=6, 2x=20⟹x=10. We have the point (10,6).
- If y=8, 2x=26⟹x=13. We have the point (13,8).
- If y=10, 2x=32⟹x=16. We have the point (16,10).
- If y=12, 2x=38⟹x=19. We have the point (19,12).
We have found 6 distinct points. To make R1 symmetric, we need the reflection of each of these points.
Since none of the points (2,4),(4,7),(6,10),(8,13),(10,16), or (12,19) are currently in our set, we must add all 6 of them. Thus, M=6.
The Elegance of R2
Multiples and Ratios
Now, let us turn our attention to R2={(x,y):−5x+4y=0}. This rearranges beautifully into the following form:
This tells us that for y to be an integer, x must be a multiple of 4. Let's walk through the possibilities:
- For x=4, y=5, giving us (4,5).
- For x=8, y=10, giving us (8,10).
- For x=12, y=15, giving us (12,15).
- For x=16, y=20, giving us (16,20).
If we try x=20, y=25, which is outside our set X. We have 4 points: (4,5),(8,10),(12,15),(16,20).
Just like before, none of these points are their own reflections, and none of their reflections exist in the set. To restore symmetry, we must add the 4 reverse pairs: (5,4),(10,8),(15,12), and (20,16).
Therefore, N=4.
The Final Synthesis
We have navigated the constraints, identified the points, and recognized the missing reflections. The total number of elements to be added is simply the sum of our requirements for both relations:
It is a simple result, but look at the journey! We used parity to solve R1 and divisibility to solve R2.
We treated the relations not as abstract symbols, but as physical entities on a grid. Keep this perspective, and you will find that even the most complex JEE problems are just stories waiting to be told.