Notes
Code
Here's a Python implementation of the algorithm we developed:
Consider a regular n n n -gon inscribed in a circle of radius 1:
Show that its perimeter is given by 2 n sin ( 36 0 ∘ 2 n ) . 2n \sin\left(\frac{360^\circ}{2n}\right). 2 n sin ( 2 n 36 0 ∘ ) .
Subdivide the n n n -gon into n n n triangles, as shown in the figure. Each such triangle shares a side with the n n n -gon; we write b b b for the length of this side and θ \theta θ for the angle opposite to it. The perimeter of the n n n -gon is thus n b ; nb; nb ; note also that θ = 36 0 ∘ n . \theta = \frac{360^\circ}{n}. θ = n 36 0 ∘ . In problem 4 from the trigonometry review , you showed that b = 2 sin ( θ / 2 ) . b = 2\sin(\theta/2). b = 2 sin ( θ /2 ) . Combining these, we get that the perimeter is 2 n sin ( 36 0 ∘ 2 n ) . 2n\sin\left(\frac{360^\circ}{2n}\right). 2 n sin ( 2 n 36 0 ∘ ) .
θ \theta θ
b b b
Recall that \(\Twopi\) is defined to be the circumference of a unit circle, and π \pi π is defined to be half this quantity. Compute approximate values of \(\Twopi\) and π \pi π (to 4 decimal points, say).