Animated Solution for Mathematics - Straight Lines: Let A be the set of all points (α,β) such that the area of triangle formed by the points (5,6),(3,2) and (α,β) is 12 square units. Then the least possible length of a line segment joining the origin to a point in A, is :
Select Answer:
Visualized Solution
Visualizing the Fixed Points
Fixed points: P1(5,6) and P2(3,2)
Plotting them on the coordinate plane.
The Variable Point and Triangle Area
Variable point: P3(α,β) in Set A
Condition: Area(△P1P2P3)=12
Applying the Area Formula
Area formula: 21∣x1(y2−y3)+x2(y3−y1)+x3(y1−y2)∣=12
Substituting: 21∣5(2−β)+3(β−6)+α(6−2)∣=12
Simplifying the Expression
Expanding terms: 21∣10−5β+3β−18+4α∣=12
Cross-multiplying by 2: ∣4α−2β−8∣=24
Refining the Locus Equation
Dividing by 2: ∣2α−β−4∣=12
Replacing (α,β) with (x,y): ∣2x−y−4∣=12
Splitting into Two Cases
Removing absolute value gives ±12
Case 1 (L1): 2x−y−4=12⟹2x−y−16=0
Case 2 (L2): 2x−y−4=−12⟹2x−y+8=0
Visualizing the Locus Lines
Set A consists of all points on lines L1 and L2.
The lines are parallel to the base P1P2.
The Objective: Shortest Distance
Goal: Least length of line segment from origin (0,0) to Set A.
This means finding the perpendicular distance from origin to L1 and L2.
Distance Formula Setup
Perpendicular distance from (0,0) to ax+by+c=0 is d=a2+b2∣c∣
For L1: d1=22+(−1)2∣−16∣
Calculating Distance to L1
d1=4+116
d1=516
Calculating Distance to L2
For L2: d2=22+(−1)2∣8∣
d2=4+18=58
Comparing and Concluding
d1=516 and d2=58
Least distance: min(d1,d2)=58
Final Answer: Option 3
00:00 / 00:00
The Sigma Insight: Distance of a Point from a Line
Solution Diagram
Analyzing the Setup
Imagine you are standing on a vast coordinate plane. You have two fixed anchors: point P1(5,6) and point P2(3,2).
You are tasked with placing a third point P3(α,β) such that the triangle formed by these three points always has an area of exactly 12 square units. As you move P3 around, you realize it is tracing a very specific path, uncovering the hidden geometry behind an algebraic constraint.
The Algebraic Foundation
To find this path, we turn to the classic area formula for a triangle with vertices (x1,y1), (x2,y2), and (x3,y3):
Area=21∣x1(y2−y3)+x2(y3−y1)+x3(y1−y2)∣
Substituting our known points (5,6) and (3,2) and our variable point (α,β), we get:
21∣5(2−β)+3(β−6)+α(6−2)∣=12
Expanding the terms inside the absolute value gives us ∣10−5β+3β−18+4α∣=24. Combining like terms, we arrive at ∣4α−2β−8∣=24.
Dividing by 2, we find the soul of our locus: ∣2α−β−4∣=12. This represents two parallel lines, 2x−y−16=0 and 2x−y+8=0, where we have replaced (α,β) with (x,y) for clarity.
The Quest for the Minimum
Now, the problem shifts. We need to find the least possible distance from the origin (0,0) to any point on these lines.
We use the distance formula for a point (x0,y0) to a line ax+by+c=0:
d=a2+b2∣ax0+by0+c∣
For our first line, 2x−y−16=0, the distance is:
d1=22+(−1)2∣−16∣=516
For our second line, 2x−y+8=0, the distance is:
d2=22+(−1)2∣8∣=58
The Final Revelation
We are looking for the least possible length. Comparing d1=516 and d2=58, it is clear that the second line is closer to the origin.
The area constraint effectively traps our point on two parallel tracks, and the origin simply picks the track that is closer to it. The final answer is: