Yesterday (while doodling in my Number Theory class) I was just playing with diagonals of polygons and something interesting appeared on my notebook. For the first time in my life I have discovered a theorem and its proof on my own (it’s original!). In this blog-post I will share it with you all!

Consider an -sided polygon, and start drawing diagonals from each vertex one-by-one. While doing so count the number of new diagonals contributed by each vertex. Here is the “Experiment” done for .

Based on above experiment, I observed:

The number of new diagonals contributed by each vertex of a -sided polygon follows the sequence:

Now let’s try to prove this observation:

Since we can’t draw diagonals to the adjacent vertices, each vertex will have diagonals.

Now, let’s count the new contribution of each vertex by considering restrictions on the maximum possible contribution (which is ).

For first vertex, we have no restriction, so it will contribute diagonals.

Also, since second vertex in adjacent to first one and both can’t affect each-other’s contribution, it will also contribute diagonals.

But, starting with third vertex we observe that first vertex has already taken one of the diagonals from its maximum contribution (second vertex can’t affect its contribution count since it’s adjacent vertex), thus it contributes (new) diagonals.

Continuing same way, for vertex, consider the restriction to contribution caused by to vertices. Thus for we get the number of new diagonals contributed by vertex equal to .

Since new contribution can’t be negative and for vertex we end up with zero (new) contribution, vertex will also contribute zero diagonals.

Combining all of the above arguments I complete the proof of my observation and call it **“New Diagonal Contribution Theorem” (NDCT).**