ExamBro
ExamBro
COMEDK · Maths · 4. Permutation Combination

The number of triangles in a complete graph with 10 non-collinear vertices is

  1. A 360
  2. B 240
  3. C 120
  4. D 60
Verified Solution

Answer & Solution

Correct Answer

(C) 120

Step-by-step Solution

Detailed explanation

Consider that there are \(m\) collinear points out of total \(n\) points in a plane. To construct a triangle we require 3 non-collinear points. Hence, the number of triangles will be \({ }^{n} C_{3}-{ }^{m} C_{3}\). Since, all the point in the above question are non-collinear,…