Cutting the plane

Geometry Level 3

A polygon has 2017 number of sides. If each point of a diagonal is inside of the polygon, then we color the diagonal red.

What is the minimum value of the number of red diagonals?

2015 None of the others 2016 2017 2014 2018 2013

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.

1 solution

Zach Abueg
Jul 31, 2017

For any n n -gon, there are n 3 n - 3 internal diagonals. This is simply because there are n n vertices for diagonals to come from, and 3 3 they cannot go to: themselves, and the 2 2 vertices directly adjacent to them, since the segments connecting those vertices are actually sides.

Thus, for n = 2017 n = 2017 , we have 2014 \boxed{2014} red diagonals.

Hm, can you elaborate? I agree that from each vertex, there are n 3 n - 3 diagonals because we have to exclude 3 vertices. So there are a total of n ( n 3 ) 2 \frac{ n(n-3) } { 2} diagonals.

How does that imply that in an n-gon, there are at least n 3 n-3 internal diagonals?

Calvin Lin Staff - 3 years, 10 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...