The Geometry of Progressions
Imagine you are standing before a polygon, but not just any polygon. This one is special. Its interior angles are not random; they are dancing to the rhythm of an Arithmetic Progression.
The smallest angle starts at 120∘, and each subsequent angle grows by a steady 5∘. Our mission is to determine how many sides, n, this polygon possesses.
This problem is a classic JEE trap, designed to test whether you can bridge the gap between pure algebra and geometric reality.
The Dual Nature of Summation
To solve this, we must look at the sum of the interior angles from two different perspectives.
First, we have the rigid, unyielding law of Euclidean geometry. For any n-sided polygon, the sum of interior angles is given by the formula:
Second, we have the fluid nature of our Arithmetic Progression. The sum of the first n terms of an A.P. is given by:
Here, a=120∘ and d=5∘. We now have two expressions for the same total sum. The bridge between them is simple equality.
The Algebraic Bridge
Let us equate these two expressions:
2n[2(120)+(n−1)5]=(n−2)180
Now, we must navigate the algebra with precision. Multiplying both sides by 2 clears the fraction:
Simplifying the bracket, we get n[235+5n]=360n−720. Expanding this leads us to:
Bringing everything to one side, we arrive at the quadratic equation:
Dividing by 5 simplifies our life significantly:
The Quadratic Trap
Factorizing this quadratic is the next step. We need two numbers that multiply to 144 and add to −25. Those numbers are −9 and −16.
Thus, we have:
This gives us two potential candidates: n=9 or n=16. Here is where the JEE examiner smiles, waiting to see if you will blindly accept both.
But we are smarter than that. We must apply the Convexity Constraint.
The Geometric Reality Check
For a polygon to be convex, every single interior angle must be strictly less than 180∘. Let us test our candidates.
The largest angle in our polygon is the n-th term of the A.P., given by an=a+(n−1)d. For n=16, the largest angle is:
This is impossible! A 195∘ angle makes the polygon concave, caving inward. We must reject n=16.
Now, testing n=9, the largest angle is:
Since 160∘<180∘, this is perfectly valid. The polygon has exactly 9 sides.
Always remember: algebra provides the possibilities, but geometry dictates the truth.