Math, asked by mudit11, 1 year ago

Only people with working brain can answer.

Nah, not you.​

Attachments:

brunoconti: resend
brunoconti: i have the answer

Answers

Answered by brunoconti
4

Answer:

Step-by-step explanation:

Attachments:
Answered by Modulus
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