An Intriguing combinatorics problem

If no three diagonals of a convex n-gon is concurrent,prove that the polygon is divided into

(n4)+((n1)2){n \choose 4} + {(n-1) \choose 2}

when all of its diagonals are drawn.

#Physics #MathProblem #Math

Note by Soham Chanda
7 years, 10 months ago

No vote yet
5 votes

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

You can view the obtained figure as a graph, where the vertices are the vertices of the polygon and the intersection points. What is the degree of each interior vertex?

Jorge Tipe - 7 years, 10 months ago

Sorry for my poor English.it is a nice question and i have a lot of fun to cope with it.my proof uses some following results: 1.number of intersection when all of its diagonals are drawn is (n4)\binom{n}{4} 2.assume that when all of its diagonals are drawn,it will devide the convex n-polygon into a triangle,b quadrilateral,c pentagon... The answer of this problem is exactly a+b+c+...a+b+c+... 2a) we calculate all the angles in 2 ways.then we have: 360(n4)+180(n2)=180a+360b+540c+...360\binom{n}{4}+180(n-2)=180a+360b+540c+... We deduce that 2(n4)+n2=a+2b+3c+...2\binom{n}{4}+n-2=a+2b+3c+... 2b) we calculate all segments in 2 ways.then we have: 4(n4)+n(n3)+n=3a+4b+5c+...4\binom{n}{4}+n(n-3) +n=3a+4b+5c+... From 2a and 2b we have the answer

Hunter Killer - 7 years, 10 months ago

No. Of diagonals of a convex n-gon is number of pair of points minus the number of sides of polygon (n2){ n \choose 2} - n

No. Of intersection points of diagonals is (n4){n \choose 4}

Now initially we have a complete n-gon. Observe that one part is added for each diagonal and one for each intersection point. Hence total no. Of parts in which the n-gon is divided is equal to

(n2){n \choose 2} - n + (n4){n \choose 4} +1=(n4){n \choose 4} + (n12){n-1 \choose 2}

We added one because initially when we had no diagonal and no intersection point, the n-gon was 'divided' into one part which was equal to the n-gon itself

Ankit Sultana - 7 years, 10 months ago

Could this be proved by induction? The case is clearly true for n=4n=4, the base case. Assuming the theorem is true for the kkth case, can new sections be counted in the k+1k+1th case?

Tanishq Aggarwal - 7 years, 10 months ago
×

Problem Loading...

Note Loading...

Set Loading...