The solutions to the equation are connected in the complex plane to form a convex regular polygon, three of whose vertices are labeled and . What is the least possible area of
Problem 265
Pick one
Official solutions — 2
Solution 1
Recall that translations preserve the shapes and the sizes for all objects. We translate the solutions to the given equation units right, so they become the solutions to the equation
We rewrite to the polar form where is the magnitude of such that and is the argument of such that
By De Moivre's Theorem, we have from which
so
so
In the complex plane, the solutions to the equation are the vertices of a regular octagon with center and radius
The least possible area of occurs when and are the consecutive vertices of the octagon. For simplicity purposes, let and as shown below.
[asy] /* Made by MRENTHUSIASM */ size(200); int xMin = -2; int xMax = 2; int yMin = -2; int yMax = 2; int numRays = 24; //Draws a polar grid that goes out to a number of circles //equal to big, with numRays specifying the number of rays: void polarGrid(int big, int numRays) { for (int i = 1; i < big+1; ++i) { draw(Circle((0,0),i), gray+linewidth(0.4)); } for (int i=0;i<numRays;++i) draw(rotate(i*360/numRays)*((-big,0)--(big,0)), gray+linewidth(0.4)); } //Draws the horizontal gridlines void horizontalLines() { for (int i = yMin+1; i < yMax; ++i) { draw((xMin,i)--(xMax,i), mediumgray+linewidth(0.4)); } } //Draws the vertical gridlines void verticalLines() { for (int i = xMin+1; i < xMax; ++i) { draw((i,yMin)--(i,yMax), mediumgray+linewidth(0.4)); } } horizontalLines(); verticalLines(); polarGrid(xMax,numRays); draw((xMin,0)--(xMax,0),black+linewidth(1.5),EndArrow(5)); draw((0,yMin)--(0,yMax),black+linewidth(1.5),EndArrow(5)); label("Re",(xMax,0),2*E); label("Im",(0,yMax),2*N); //The n such that we're taking the nth roots of unity multiplied by 2. int n = 8; pair A[]; for(int i = 0; i <= n-1; i+=1) { A[i] = rotate(360*i/n)*(sqrt(3),0); } label("",A[1],1.5*NE,UnFill); label("",A[2],1.5*NE,UnFill); label("",A[3],1.5*NW,UnFill); fill(A[1]--A[2]--A[3]--cycle,green); draw(A[1]--A[3]^^A[0]--A[1]--A[2]--A[3]--A[4]--A[5]--A[6]--A[7]--cycle,red); for(int i = 0; i< n; ++i) dot(A[i],red+linewidth(4.5)); [/asy]
Note that has base and height so its area is
~MRENTHUSIASM
Solution 2
1. The given equation is . To solve for , we first take the eighth root of both sides:
Since , we have:
Therefore, the solutions are:
Solving for , we get:
2. These solutions form the vertices of a regular octagon centered at with radius in the complex plane.
3. To find the least possible area of , we consider three consecutive vertices of the octagon. The vertices of the octagon are given by:
4. The area of is minimized when , , and are consecutive vertices. Let's denote these vertices as , , and .
5. The angle between two consecutive vertices of the octagon is:
6. The area of can be calculated using the formula for the area of a triangle formed by three points in the complex plane:
7. Since the vertices are consecutive, we can use the fact that the area of a triangle formed by three points on a circle is given by:
where is the radius of the circle and is the angle subtended by the arc between two points.
8. For our octagon, and :
9. However, we need to consider the area of the triangle formed by three consecutive vertices, which involves subtracting the area of the overlapping triangles. The correct calculation involves:
where each of these areas is:
10. Therefore, the area of is:
The final answer is