Only people with working brain can answer.
Nah, not you.
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Answer:
Step-by-step explanation:
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