Let be a triangle. Consider four points on the side AB, five points on the side , and four points on the side . None of these points is a vertex of the trinagle . Then the total number of pentagons, that can be formed by taking all the vertices from the points , is_______
Total number of ways to choose any five points from the thirteen given points is
These points lie on the three sides of triangle : - Side has 4 points, - Side has 5 points, - Side has 4 points. A pentagon cannot have three collinear vertices, so we must exclude all choices that pick three or more points from any one side.
Let = selections with at least 3 points on , = selections with at least 3 points on , = selections with at least 3 points on . We will use inclusion-exclusion to count the invalid selections.
Compute : choose points from the 4 on and the remaining from the other 9 points.
Compute similarly, choosing points from the 5 on and from the other 8 points:
Compute the same way as (since also has 4 points):
For any two of these events (say and ), requiring at least 3 points from and at least 3 from would select at least 6 points, which exceeds 5. Hence all intersections , , and the triple intersection are empty. By inclusion-exclusion, the total number of invalid selections is
Therefore, the number of valid pentagons is
Answer: 660
Tagged Counting in geometry. Machine-assigned, so read it as a strong shortlist rather than a verdict.