Waste less time on Facebook — follow Brilliant.

Problems with diagonals

Alright, so I've been bombarded /bombarded myself with questions lately and I either a) can't solve them or b) don't have the time. So if you can answer any of the following questions or even yeild a clue as what to do I'd really appreciate it

a) what's the probability that when two random diagonals of a polygon are chosen, they intersect within the region of the polygon. A general formula for all polygons that don't have an intersection made of more than two diagonals is \(\dfrac{\dbinom{n}{4}}{\dbinom{\left(\dfrac{n(n-3)}{2}\right)}{2}}\)

b) what's the area of the n-gon formed in a 2n-sided figure by connecting 1/2 of everyother vertex. (Exg: connecting 1/2 of everyother vertex of an octagon will form a square.)

C) what's the area of the 2n sided figure formed by connecting everyother vertex in a 2n-gon. (Exg: when doing this, an octagon is formed inside an octagon)

D) what's the area created by joining every k th vertex. I personally think that the best approach to this is to find the length of the diagonal when k divides n without remainder. This is much easier and, in my opinion, actually possible.

Most of the info that I along with some others have generated is in the comment section of this problem.

Note by Trevor Arashiro
2 years, 1 month ago

No vote yet
1 vote


Sort by:

Top Newest

What is the maximum possible points of intersection of 2 circles??? Aman Verma · 2 years ago

Log in to reply

Note that under affine transformations, interior polygons are still similar to exterior polygons and so the answer to (b), (c) and (d) hold for non-regular polygons. Jake Lai · 2 years, 1 month ago

Log in to reply

@Jake Lai Nice observation! But for now I'm just trying to prove the cases for regular polygons. Irregular polygons is the next step Trevor Arashiro · 2 years, 1 month ago

Log in to reply

@Trevor Arashiro Yeah, it should be easy enough to prove after generalising joining every kth point for regular polygons. Jake Lai · 2 years, 1 month ago

Log in to reply

@Jake Lai So far, for even n, and joining every other vertex, I'm getting \(\dfrac{na^2(1-\cos{(180-\frac{360}{n})})(\cot{\frac{360}{n}})}{2}\)

Where n is the number of sides of the reference polygon and x is the sidelength of the reference polygon.


If k divides n without remainder, the formula is \(\dfrac{a^2n(cot{\frac{k_i180}{n}})(\csc^2{(\frac{180}{n})})(1-\cos{(\frac{k_i360}{n})})}{8k_i}\) where k is joining every kth vertex Trevor Arashiro · 2 years, 1 month ago

Log in to reply

For a) you can note that each intersection of diagonals inside the polygon is in fact determined by the two pairs of points that determine those diagonals; also, if you choose four points at random, whatever the set of four points it is, you can join two pair of them appropiately to construct an intersection, so the bijection tells you that the number of intersections is nC4. The number of pairs of diagonals is got to be dC2 where d is the number of diagonals which can easily be reduced to n(n-3)/2. The probability is then the quotient. Héctor Andrés Parra Vega · 2 years, 1 month ago

Log in to reply

(For the case of regular polygons)

Using complex numbers (esp roots of unity) can be very helpful. It is clear that we will get a regular polygon (by symmetry), and hence mainly need to find the radius / side length. Calvin Lin Staff · 2 years, 1 month ago

Log in to reply


Problem Loading...

Note Loading...

Set Loading...