Only people with working brain can answer.
Nah, not you.
Attachments:
brunoconti:
resend
Answers
Answered by
4
Answer:
Step-by-step explanation:
Attachments:
Answered by
1
Interesting!
You take n sided polygon, it has n vertices. You join 3 at a time to form a triangle, so you find how many different ways can you join 3 points, that is, nC3
i.e. n!/(n-3)! (3!) = n (n-1) (n-2)/6
Similar questions
English,
6 months ago
Computer Science,
6 months ago
Computer Science,
6 months ago
Math,
1 year ago
Hindi,
1 year ago
English,
1 year ago