Number Of Triangles From Points
Given 10 points in a plane of which no three are collinear, the number of distinct triangles that can be formed using these points as vertices equals which value?
Select the correct option:
Solution
120
A triangle is determined by choosing 3 non-collinear points, so when no three points are collinear the count is simply a combination, a clean JEE Advanced geometry-counting result. With 10 points and no three collinear, every selection of 3 points forms a valid triangle, and the number of such selections is C(10, 3) = (10 × 9 × 8)/(3 × 2 × 1) = 120. The non-collinearity condition ensures no chosen triple is degenerate. Option 720 = P(10,3) counts ordered triples, overcounting each triangle 6 times. Option 30 miscomputes the combination. Option 100 has no combinatorial basis. Hence there are 120 triangles. Plausibility check: dividing the ordered triple count 10 × 9 × 8 = 720 by 3! = 6 to remove vertex orderings gives 120, matching C(10,3) and confirming that each unordered triple yields exactly one triangle. Distributing distinct objects into distinct boxes assigns each object an independent choice, so the count is an exponential and coincides exactly with the number of functions between the corresponding sets. Recognizing this equivalence between distributions and functions unifies counting problems with the function-counting results from sets and relations, a connection examiners value across chapter boundaries.
🔒 Solution Hidden from View
Submit your answer to unlock the detailed step-by-step solution.
About This Question
- Subject
- mathematics
- Chapter
- permutations and combinations
- Topic
- number of triangles from points
- Difficulty
- Medium
- Year
- 2025
Solution
Correct Answer:
120
A triangle is determined by choosing 3 non-collinear points, so when no three points are collinear the count is simply a combination, a clean JEE Advanced geometry-counting result. With 10 points and no three collinear, every selection of 3 points forms a valid triangle, and the number of such selections is C(10, 3) = (10 × 9 × 8)/(3 × 2 × 1) = 120. The non-collinearity condition ensures no chosen triple is degenerate. Option 720 = P(10,3) counts ordered triples, overcounting each triangle 6 times. Option 30 miscomputes the combination. Option 100 has no combinatorial basis. Hence there are 120 triangles. Plausibility check: dividing the ordered triple count 10 × 9 × 8 = 720 by 3! = 6 to remove vertex orderings gives 120, matching C(10,3) and confirming that each unordered triple yields exactly one triangle. Distributing distinct objects into distinct boxes assigns each object an independent choice, so the count is an exponential and coincides exactly with the number of functions between the corresponding sets. Recognizing this equivalence between distributions and functions unifies counting problems with the function-counting results from sets and relations, a connection examiners value across chapter boundaries.
This medium difficulty mathematics question is from the chapter permutations and combinations, covering the topic of number of triangles from points. It appeared in the 2025 exam.
Looking for more practice? Explore all mathematics questions or browse permutations and combinations questions on RankGuru.