Expected Triangle In Regular N-gon

Calculus Level 1

Consider the N N vertices of a regular N N- gon that is inscribed in a unit circle. There are ( N 3 ) { N \choose 3 } possible subsets of 3 vertices, which form triangles. If the expected area of the triangle is

5 5 + 2 5 24 , \frac{ 5 \sqrt{ 5 + 2 \sqrt{5} } } { 24 } ,

what is the value of N N ?

10 20 5 15

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.

3 solutions

Note that the general formula for the expected area of a triangle formed in this scenario is

E ( A N ) = 3 N cot ( π N ) 2 ( N 1 ) ( N 2 ) E(A_{N}) = \dfrac{3N*\cot(\frac{\pi}{N})}{2(N - 1)(N - 2)} .

Now, assuming that the radical can be attributed to the cot ( π N ) \cot(\frac{\pi}{N}) factor, we check to see what value of N N we get from the equation

5 24 = 3 N 2 ( N 1 ) ( N 2 ) \dfrac{5}{24} = \dfrac{3N}{2(N - 1)(N - 2)}

5 ( N 2 3 N + 2 ) = 36 N \Longrightarrow 5*(N^{2} - 3N + 2) = 36*N

5 N 2 51 N + 10 = 0 ( 5 N 1 ) ( N 10 ) = 0 N = 10 \Longrightarrow 5*N^{2} - 51*N + 10 = 0 \Longrightarrow (5N - 1)(N - 10) = 0 \Longrightarrow N = 10 ,

as N N must be an integer. After confirming (using a calculator) that cot ( π 10 ) = 5 + 2 5 \cot(\frac{\pi}{10}) = \sqrt{5 + 2\sqrt{5}} , we can conclude that N = 10 N = \boxed{10} .

Here is the paper where the general formula stated above is proved.

@Brian Charlesworth Ummm Sir, could you please check the link again....?? It does not work.......

Aaghaz Mahajan - 2 years, 5 months ago

I've updated the link so it should work for you now. The general formula is given in Theorem 2 of the paper.

Brian Charlesworth - 2 years, 5 months ago

Log in to reply

Thanks a lot, Sir!! It is amazing how you can find such papers on almost all topics!!

Aaghaz Mahajan - 2 years, 5 months ago
Nguyen Thanh Long
May 29, 2014

Each triangle has area is appropriate to: 2 × π n = 5 5 + 2 × 5 24 n = 10 \frac{2 \times \pi}{n} = \frac{5 \sqrt{5 + 2 \times \sqrt{5}}}{24} \Rightarrow n=\boxed{10}

Hm, can you explain in detail how you're getting at this equation?

Also, how did you solve for n n ? In the current equation, it should be transcendental.

Calvin Lin Staff - 5 years, 11 months ago
Vincent Moral
Feb 27, 2018

Place N-gon at the center of the Argand diagram and label each vertices v 1 , v 2 , v 3 , . . . , v N v_{1}, v_{2}, v_{3}, ..., v_{N} . ( v 1 v_{1} at (1, 0) counterclockwise)

Given three vertices, the area of the triangle is equal to 1 2 ( v a v b ) × ( v b v c ) \frac{1}{2}|(\vec{v_{a}} - \vec{v_{b}}) \times (\vec{v_{b}} - \vec{v_{c}})| where v a , v b , v c \vec{v_{a}}, \vec{v_{b}}, \vec{v_{c}} are radius vectors.

Basically, the code below gets the mean (average) value of triangle areas for each possible value of N.

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
from math import pi
from cmath import rect
from itertools import combinations

def vertex_angle(vertex_number, N):
    """Returns the angle (in radians) of nth unit radius vector
    with respect to +x axis"""
    return 2*pi*(vertex_number - 1)/N

def cross_product_magnitude(vector1, vector2):
    """Returns the magnitude of vector1 x vector2"""
    return abs((vector1 * vector2.conjugate()).imag)

for N in range(3, 15+1):
    sum_areas = 0.0
    num_triangles = N*(N-1)*(N-2)/6 # equal to NC3

    for vertices in combinations(range(1, N+1), 3):
        vectors = [rect(1, va) for va in [vertex_angle(vertex, N) for vertex in vertices]]
        area = 0.5*cross_product_magnitude(vectors[1] - vectors[0], vectors[2] - vectors[0])
        sum_areas += area

    print "(N, mean_area): ", N, sum_areas/num_triangles

Looking up the value of N where expected area is approximately equal to 0.641184, the answer is 10.

How is this an expected value question?

Jason Li - 1 year, 8 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...