A
regular polygon
has all its vertices on a parabola.
What is the maximum number of vertices of the polygon?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Great argument, bounding the angles of the regular polygon.
Nicely done! (+1)
Easy way to do it is :
A regular polygon can be inscribed in a circle
A circle can intersect a parabola at a max of 4 times
Proof of above statement:
Let
y = m x 2
( y − a ) 2 + ( x − b ) 2 = r 2
Subbing first equation into second you get a polymonial of deg 4
hence there are only 4 possible solutions at the max
you are left with 3 and 4 vertices (4 is impossible due to the fact that is has to be a square and has 90 deg)
Therefore answer is 3
But Ivan Koswara's solution is more interesting
Clearly if it is a regular polygon then at max. It can have 3 vertices each eqiuidistant from each other & lying on the same parabola .
Hence the polygon is equilateral triangle. And thus the ans. Is 3.!
I dont know much about the concept. So it would be nice if someone explains it in a better way. ! Thank you.
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Regular Polygons - Problem Solving - Medium
Rotate the plane so that the parabola is facing up, and put a coordinate system so that the parabola is y = c x 2 for some c > 0 . Label the vertices of the polygon as A 1 , A 2 , … , A n in order from left to right. (There is exactly one point on the parabola for each abscissa, so no two points of the polygon will have the same abscissa, thus we can label them from left to right.) Since the polygon is regular, it is convex, so it must be A 1 A 2 … A n (in that order).
Without loss of generality, assume that A 1 is not lower than A n (otherwise reflect the plane through the y-axis). Note that because a parabola is convex, A 1 is now also the topmost point. (If for some A k , we have A k higher than both A 1 and A n , then it contradicts the convexity of the parabola.)
Let A 1 = ( x 1 , y 1 ) , A 2 = ( x 2 , y 2 ) , A n = ( x n , y n ) . Observe that x 1 < x 2 and x 1 < x n (because A 1 is the leftmost point), but y 1 ≥ y 2 and y 1 ≥ y n (because A 1 is the topmost point). Thus the vector A 1 A 2 and A 1 A n are both pointing to the fourth quadrant, and thus the angle between them cannot be greater than 9 0 ∘ . In fact, it cannot be 9 0 ∘ either, since neither of them is pointing to the negative y-axis.
But we know that the angles of a regular polygon is given by the formula n n − 2 ⋅ 1 8 0 ∘ . For n ≥ 4 , we have n n − 2 ⋅ 1 8 0 ∘ ≥ 4 2 ⋅ 1 8 0 ∘ = 9 0 ∘ , contradicting the result that the angle A 2 A 1 A n is less than 9 0 ∘ . This proves that n ≤ 3 .
To show that n = 3 is possible, just choose c = 3 , A 1 = ( − 1 , 3 ) , A 2 = ( 0 , 0 ) , A 3 = ( 1 , 3 ) . This proves that the maximum number of vertices is 3 .