There is a polygon with 10 sides. A point is there in the middle of the polygon and all the vertices are joined with the point and therefore producing 10 triangles. In exactly how many ways can you select three triangles no two of which are adjacent.
A) 112
B) 120
C) 468
D) 710
E) None of these
Subscribe to:
Post Comments (Atom)
Posts
2 comments:
B
I believe you will use permutation (for clockwise and anti clock wise arrangements are same ) formula i.e. nPr / 2r. So the answer would be 10! / (7! * 2*3) = 120
Post a Comment