There are points in a plane, no three of which are in the same straight line, except points which are collinear. Then the total number of triangles that can be formed with the vertices at any three of these points is:
- A
- B
- C
- D
There are points in a plane, no three of which are in the same straight line, except points which are collinear. Then the total number of triangles that can be formed with the vertices at any three of these points is:
Correct answer:A
Standard Method
Given: There are points in a plane, and no three are collinear except points which are collinear.
Find: The total number of triangles that can be formed.
First count all possible ways of choosing any points from points:
Now subtract the selections in which all points come from the collinear points, because such points do not form a triangle:
Therefore, the required number of triangles is:
Therefore, the total number of triangles is . The correct option is A.
Subtract Invalid Selections
Given: Total points are , and of them are collinear.
Find: The number of valid triangles.
A triangle is formed whenever the chosen points are not collinear. So count all triples and remove only the invalid collinear triples:
This works because the only triples that fail to form triangles are those chosen entirely from the collinear points.
Therefore, the correct option is A.
Subtracting instead of . The issue is that we must remove the number of collinear triples, not the number of collinear points. Always count invalid selections using combinations.
Using and stopping there. This is wrong because some chosen triples do not form triangles. Always exclude sets of collinear points.
Thinking that any selection involving one or two of the collinear points is invalid. That is incorrect because a triangle fails only when all chosen points lie on the same straight line. Mixed selections can still form triangles.
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.