\(~\)\(~\)\(~\)\(~\)\(~\)\(~\)\(~\)\(~\)\(~\)In this note, I will prove that the area formed by connecting every kth vertex of a regular polygon is \(\dfrac{a^2n(\cot{\frac{180k_i}{n}})(\csc^2{(\frac{180}{n})})(1-\cos{(\frac{k_i360}{n})})}{8k_i}\) when \(\textbf{k divides n without remainder}\) and n=number of sides of the original polygon and a represents the side length of the original polygon.
Can someone link me to a website so I can read up on it? I haven't been able to find one.
Step one: determining the number of sides
This step is rather simple. The number of sides of the original polygon R divided by k will yield the new polygon’s number of sides.
This is because #vertices=#edges. And since we’re dividing the number of vertices by k, the number of edges will be divided by k as well.
Therefore, the number of sides =kin
Step two: determining the length of each side
image
Ok, this is the hard part. For this part, I will refer to the second picture (also, NOTE 1,2,3,4 represent possible values of k). Begin by looking at the angled formed by θ. It’s quite obvious that each angle is congruent. Also, θ=n360. Now, if we’re going to connect every kth vertex starting with vertex J, the angle (NOTE: point k varies in position) formed will be equal to ∠JPKi=kiθ.
Now, the one thing that remains constant no matter what vertex we chose is the length from the center of the original polygon to each vertex, AKA: the radius. The radius r is the hypotenuse of a right triangle with one leg as its apothem and the other leg being 2a. The angle at P of the right triangle is 2θ. Therefore, r=(2a)csc(2θ).
Now, using Law of Co-sines, we can find M (length of segment Jki) in terms of kiθ and r (r is in terms of a and csc here).
m2=r2+r2−2(r)(r)cos(kiθ)
m2=2r2(1−cos(kiθ))
Substituting for r=(2a)csc(2θ)
m2=2[(2a)csc(2θ)](1−cos(kiθ))
Substituting for θ=n360
m2=2[4a2csc2(2(n360))](1−cos(ki(n360))
m2=2a2csc2(n180)(1−cos(n360k))
Finding the area
This step isn't so hard, in this note, I prove that the area of any regular polygon can be represented as 4(kin)cot(n180ki)m2. (NOTE: that I substituted a=m from the other note and the number of sides is kin rather than n because in this note I’m using different variables than in the other note)
Plugging in our value of m2 yeilds
area=4(kin)cot(n180ki)(2a2csc2(n180)(1−cos(n360ki))).
area=8kincot(n180ki)(a2csc2(n180)(1−cos(n360ki))).
area=8kia2n(cotn180ki)(csc2(n180))(1−cos(nki360))
#Geometry
#Combinatorics
#Polygons
#Proofs
#Easymoney
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Is this a new theorem? And can anyone build upon it such that k doesn't necessarily have to divide n?
Log in to reply
Probably not. You can probably use the same application of cosine rule to prove the case where k doesn't divide n; I did that when doing proving the case k = 2 for all n.
Log in to reply
How does your formula work? I'm plugging in x=cos60 for a hexagon and I'm getting 25/4. But I think that it should be 1/4
Log in to reply
If k∤n then you cannot have a regular polygon.
Thanks...But I am not getting it. Is there anyone who can explain me in simpler words..please?