A regular 30-gon

Geometry Level 5

If A 1 , A 2 , A 3 , , A 30 A_1 , A_2 , A_3 , \ldots , A_{30} are the vertices of a regular 30-gon inscribed in a unit circle, then find

A 1 A 2 2 + A 1 A 3 2 + A 1 A 4 2 + + A 1 A 30 2 . {|A_1 A_2|}^2 + {|A_1 A_3|}^2 + {|A_1 A_4|}^2 + \cdots + {|A_1 A_{30}|}^2 .


The answer is 60.

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.

6 solutions

Michael Mendrin
Jan 1, 2017

Use the Pythagorean Theorem for this one. The diameter of the circle is 2 2 , so that the sum of the squares of the non-hypotenuse sides of any right triangle with the diameter as the base is 4 4 . Besides the diagonal that is the diameter itself, there are 14 14 other diagonal pairs that make for the sides of such right triangles. Hence, the answer is 4 ( 1 + 14 ) = 60 4(1+14) = 60

Example, for diagonal A 1 A 15 A_1A_{15} , choose diagonal A 1 A 2 A_1A_2 to make such a pair that will form a right triangle, with base A 1 A 16 A_1A_{16} , etc.

This is the exact way I solved it too. I think this solution should be way higher rated than it is.

Josh Banister - 4 years, 5 months ago

What a solution!

Atomsky Jahid - 4 years, 5 months ago

Can you please explain in details ? Thank you.

Niranjan Khanderia - 4 years, 4 months ago

Let w = e 2 π i / n w=e^{2 \pi i/n} , where n n is the number of sides of the polygon. We want to find the sum: S = k = 0 n 1 1 w k 2 = k = 0 n 1 1 cos 2 π k n i sin 2 π k n 2 = k = 0 n 1 ( ( 1 cos 2 π k n ) 2 + sin 2 2 π k n ) = k = 0 n 1 ( 2 2 cos 2 π k n ) = 2 n 2 k = 0 n 1 cos 2 π k n = 2 n 2 Re ( k = 0 n 1 w k ) = 2 n 2 Re ( w n 1 w 1 ) = 2 n 2 Re ( 1 1 w 1 ) = 2 n \begin{aligned} S &= \sum_{k=0}^{n-1} |1-w^k|^2\\ &= \sum_{k=0}^{n-1} \left|1-\cos \dfrac{2 \pi k}{n}-i \sin \dfrac{2 \pi k}{n}\right|^2\\ &= \sum_{k=0}^{n-1} \left(\left(1-\cos \dfrac{2 \pi k}{n}\right)^2+\sin^2 \dfrac{2 \pi k}{n}\right)\\ &= \sum_{k=0}^{n-1} \left(2-2\cos \dfrac{2 \pi k}{n}\right)\\ &= 2n-2\sum_{k=0}^{n-1} \cos \dfrac{2 \pi k}{n}\\ &= 2n-2\text{Re}\left(\sum_{k=0}^{n-1} w^k\right) = 2n-2\text{Re}\left(\dfrac{w^n-1}{w-1}\right)\\ &= 2n-2\text{Re}\left(\dfrac{1-1}{w-1}\right) = 2n\\ \end{aligned} In this case we have n = 30 n=30 , so S = 2 ( 30 ) = 60 S=2(30)=\boxed{60} .

A splendid solution!

Tapas Mazumdar - 4 years, 5 months ago

You can skip some of the steps in the middle if you notice 1 w k 2 = ( 1 w k ) ( 1 w k ) = ( 1 w k ) ( 1 w k ) = 2 w k w k |1-w^k|^2 = (1-w^k)\overline{(1-w^k)} = (1-w^k)(1-w^{-k}) = 2 - w^k - w^{-k}

Brian Moehring - 4 years, 5 months ago
Ahmad Saad
Mar 14, 2017

That's one good solution! I liked it. :-)

Tapas Mazumdar - 4 years, 2 months ago

Log in to reply

Thanks. I hope that.

Ahmad Saad - 4 years, 2 months ago

U s i n g C o s L a w , w e h a v e 29 d i a g o n a l s . S o : i = 1 29 ( 1 2 + 1 2 2 1 1 C o s ( 2 π 30 i ) ) = 60. Using ~Cos ~Law,~ we~ have~ 29~ diagonals.~~ So:-\\ \displaystyle \sum_{i=1}^{29}\left (1^2+1^2-2*1*1*Cos \left(\dfrac{2*\pi}{30}*i \right) \right )=60.
I have used TI-83 Plus calculator with following pressed 29 times.
0 STO-> X ENTER
0 STO-> A ENTER
ENTER
ENTER
1 + X S T O X : A + 2 ( 1 C o s ( X 2 π 30 ) ) S T O A 1+X ~STO\rightarrow~X~ :~ A+2*\left (1 - Cos \left (\dfrac{X*2\pi}{30} \right ) \right )~ STO\rightarrow~A ENTER ENTER ENTER . . . ENTER....29 times.





Harry Jones
Dec 29, 2016

Use simple trigonometry and get the sides of the polygon.Then add them up and use formula for trigonometric angles in Arithmetic progression.

Can you elaborate on it? I don't know what "simple trigonometry" you're referring to.

Pi Han Goh - 4 years, 5 months ago

try to use cosine rule find length of the sides using radius of circle and angle subtended by the side.

Harry Jones - 4 years, 5 months ago
Paul Hindess
Dec 28, 2016

Working up from equilateral triangle, square, regular pentagon, the pattern was compelling enough to chance a guess. No pen and paper available to attempt a proof!

What a pleasant and intriguing surprise! Thank you!

I know this doesn't constitute a solution, but just wanted to express my pleasure at an intriguing problem...

Paul Hindess - 4 years, 5 months ago

Log in to reply

Please refer to my proof for your observation. Sorry. It seems to have been canceled !!!

Niranjan Khanderia - 4 years, 4 months ago

I don't see any pattern. How did you solve this?

Pi Han Goh - 4 years, 5 months ago

Log in to reply

If n is the number of sides of the polygon, then the sum of squares we are trying to find turns out to be 2n. In the case n = 30, we have 2n = 60. I just used basic trigonometry to work out the n = 3, 4, 5 cases and when the answers came out as 6, 8, 10 ... I went with the most likely continuation... Didn't have pen or paper at the time to try and prove why...

Paul Hindess - 4 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...