What is the Sum of Lengths for a Regular n-gon Inscribed in a Unit Circle?

In summary, the conversation discusses finding the sum of the lengths of all sides and diagonals of a regular n-gon inscribed in a unit circle, denoted as S_n. The solution involves using the vertices on the unit circle to calculate the distance between points, then using a geometric series to find the value of S_n. The limit of S_n as n approaches infinity is approximately equal to 2/pi. The conversation also mentions a small question about the solution, but concludes that it does not affect the overall answer.
  • #1
lfdahl
Gold Member
MHB
749
0
Let $S_n$ be the sum of lengths of all the sides and all the diagonals of a regular $n$-gon inscribed in a unit circle.

(a). Find $S_n$.

(b). Find $$\lim_{{n}\to{\infty}}\frac{S_n}{n^2}$$
 
Mathematics news on Phys.org
  • #2
\(\displaystyle \lim_{{n}\to{\infty}}\frac{S_n}{n^2}=0\)

(?)
 
  • #3
(a). Find $S_n$.

[sp]With the vertices at the points $e^{2\pi ij/n}$ on the unit circle, the distance between $e^{2\pi ij/n}$ and $e^{2\pi ik/n}$ is $$ \begin{aligned} \bigl| e^{2\pi ij/n} - e^{2\pi ik/n} \bigr| &= \sqrt{(e^{2\pi ij/n} - e^{2\pi ik/n}) (e^{-2\pi ij/n} - e^{-2\pi ik/n})} \\ &= \sqrt{2 - 2\cos(2\pi(j-k)/n)} \\&= 2\sin(|j-k|\pi/n), \end{aligned}$$ (the mod signs coming from the fact that we want the positive square root). If we sum that for $j$ and $k$ going from $1$ to $n$ then we will count each diagonal twice (once starting from the $e^{2\pi ij/n}$ end and once from the $e^{2\pi ik/n}$ end).

Therefore \(\displaystyle S_n = \sum_{j=1}^n\sum_{k=1}^n \sin(|j-k|\pi/n).\) For each fixed $j$, the sum over $k$ will include each of the numbers $\sin\frac {r\pi}n \ (1\leqslant r \leqslant n)$ exactly once. Therefore $$S_n = n\sum_{r=1}^n \sin(r\pi/n) = n\, \text{im} \sum_{r=1}^n e^{ir\pi/n} = n\,\text{im} \frac2{1-e^{ir\pi/n}},$$(geometric series). Take the imaginary part to get $$S_n = \text{im}\,\frac{2n(1-e^{-ir\pi/n})}{(1-e^{ir\pi/n})(1-e^{-ir\pi/n})} = \frac{n\sin(\pi/n)}{1 - \cos(\pi/n)}.$$
[/sp]

(b). Find $$\lim_{{n}\to{\infty}}\frac{S_n}{n^2}$$

[sp]Do this the lazy way, replacing $\sin(\pi/n)$ and $\cos(\pi/n)$ by the start of their power series: $$\frac{S_n}{n^2} \approx \frac{n(\pi/n)}{n^2\bigl(\frac{\pi^2}{2n^2} \bigr)} = \frac2\pi.$$
[/sp]
 
Last edited:
  • #4
greg1313 said:
\(\displaystyle \lim_{{n}\to{\infty}}\frac{S_n}{n^2}=0\)

(?)
Hi, greg1313!(Wave)

In fact $$\lim_{{n}\to{\infty}}\frac{S_n}{n^2} > 0$$
Please cf. Opalg´s solution.
 
  • #5
Opalg said:
(a). Find $S_n$.

[sp]With the vertices at the points $e^{2\pi ij/n}$ on the unit circle, the distance between $e^{2\pi ij/n}$ and $e^{2\pi ik/n}$ is $$ \begin{aligned} \bigl| e^{2\pi ij/n} - e^{2\pi ik/n} \bigr| &= \sqrt{(e^{2\pi ij/n} - e^{2\pi ik/n}) (e^{-2\pi ij/n} - e^{-2\pi ik/n})} \\ &= \sqrt{2 - 2\cos(2\pi(j-k)/n)} \\&= 2\sin(|j-k|\pi/n), \end{aligned}$$ (the mod signs coming from the fact that we want the positive square root). If we sum that for $j$ and $k$ going from $1$ to $n$ then we will count each diagonal twice (once starting from the $e^{2\pi ij/n}$ end and once from the $e^{2\pi ik/n}$ end).

Therefore \(\displaystyle S_n = \sum_{j=1}^n\sum_{k=1}^n \sin(|j-k|\pi/n).\) For each fixed $j$, the sum over $k$ will include each of the numbers $\sin\frac {r\pi}n \ (1\leqslant r \leqslant n)$ exactly once. Therefore $$S_n = n\sum_{r=1}^n \sin(r\pi/n) = n\, \text{im} \sum_{r=1}^n e^{ir\pi/n} = n\,\text{im} \frac2{1-e^{ir\pi/n}},$$(geometric series). Take the imaginary part to get $$S_n = \text{im}\,\frac{2n(1-e^{-ir\pi/n})}{(1-e^{ir\pi/n})(1-e^{-ir\pi/n})} = \frac{n\sin(\pi/n)}{1 - \cos(\pi/n)}.$$
[/sp]

(b). Find $$\lim_{{n}\to{\infty}}\frac{S_n}{n^2}$$

[sp]Do this the lazy way, replacing $\sin(\pi/n)$ and $\cos(\pi/n)$ by the start of their power series: $$\frac{S_n}{n^2} \approx \frac{n(\pi/n)}{n^2\bigl(\frac{\pi^2}{2n^2} \bigr)} = \frac2\pi.$$
[/sp]

Thankyou, Opalg, for an elegant solution!(Cool)

A small question:

Concerning the index $r$: Shouldn´t $r$ have the maximum value $n-1$ and not $n$??
 
  • #6
lfdahl said:
A small question:

Concerning the index $r$: Shouldn´t $r$ have the maximum value $n-1$ and not $n$??
[sp]It doesn't really matter, because the extra term when $r=n$ is $\sin(n\pi/n) = \sin\pi = 0$. (Bigsmile)
[/sp]
 
  • #7
Opalg said:
[sp]It doesn't really matter, because the extra term when $r=n$ is $\sin(n\pi/n) = \sin\pi = 0$. (Bigsmile)
[/sp]

You´re right!(Blush)
 

FAQ: What is the Sum of Lengths for a Regular n-gon Inscribed in a Unit Circle?

What is a regular n-gon?

A regular n-gon is a polygon with n equal sides and n equal angles. It is also known as a regular polygon.

How do you inscribe a regular n-gon in a unit circle?

To inscribe a regular n-gon in a unit circle, you need to first draw a circle with a radius of 1 unit. Then, using a compass, divide the circle into n equal parts by drawing n arcs from the center of the circle. The points where these arcs intersect with the circle will be the vertices of the regular n-gon.

What are the lengths of the sides and diagonals of a regular n-gon inscribed in a unit circle?

The lengths of the sides and diagonals of a regular n-gon inscribed in a unit circle are all equal to the radius of the circle, which is 1 unit.

How do you find Sn, the sum of lengths of all sides and diagonals of a regular n-gon inscribed in a unit circle?

To find Sn, you can use the formula Sn = n * sin(360/n), where n is the number of sides in the regular n-gon. For example, for a hexagon (n=6), Sn = 6 * sin(360/6) = 6 * sin(60) = 6 * √3/2 = 3√3 units.

What is the relationship between the number of sides in a regular n-gon and the sum of its lengths?

The relationship between the number of sides in a regular n-gon and the sum of its lengths is that as the number of sides increases, the sum of lengths also increases. This can be seen in the formula for Sn, where n is in the numerator. As n increases, the value of Sn also increases.

Back
Top