Geometrical Combinations

Geometrical Combinations involve counting geometric figures (triangles, lines, diagonals, quadrilaterals, etc.) formed by joining given points in a plane. These problems combine combinatorial selection with geometric constraints, such as collinearity (points on the same line cannot form triangles).

10Worksheets
200+Practice Questions
IntermediateDifficulty
2-3 hoursHours to Master

Introduction to Geometrical Combinations

Geometrical Combinations involve counting geometric figures (triangles, lines, diagonals, quadrilaterals, etc.) formed by joining given points in a plane. These problems combine combinatorial selection with geometric constraints, such as collinearity (points on the same line cannot form triangles).

Prerequisites

Basic combination formula Understanding of collinearity Triangle formation condition Line and diagonal concepts
Why This Matters: Geometrical Combination problems appear in 1-2 questions in SSC CGL and Banking exams. They test integration of geometry with combinatorics.

How to Solve Geometrical Combinations Problems

1

Step 1: Count total number of points (n)

2

Step 2: For lines: ⁿC₂ gives total lines if no three points are collinear

3

Step 3: For triangles: ⁿC₃ gives total triangles if no three points are collinear

4

Step 4: If collinear points exist, subtract invalid combinations

5

Step 5: For lines: subtract combinations of collinear points that don't form unique lines

6

Step 6: For triangles: subtract ³C₃ for each set of collinear points

7

Step 7: For diagonals of a polygon: total lines - sides

Pro Strategy: Always calculate total combinations first, then subtract invalid combinations due to collinearity. For lines, remember that collinear points contribute only 1 line instead of multiple combinations.

Example Problem

Example: There are 10 points in a plane, 4 of which are collinear. How many triangles can be formed? Solution: Step 1: Total points = 10 Step 2: Total triangles if no collinearity = ¹⁰C₃ = 120 Step 3: Triangles that cannot be formed from 4 collinear points = ⁴C₃ = 4 Step 4: Valid triangles = 120 - 4 = 116 Answer: 116 triangles

Pro Tips & Tricks

  • Number of lines from n points with no collinearity: ⁿC₂
  • Number of triangles from n points with no collinearity: ⁿC₃
  • If m points are collinear, subtract 1 from line count (not ᵐC₂ - 1) for the unique line
  • For triangles: subtract ᵐC₃ for each collinear set
  • Number of diagonals in an n-sided polygon: n(n-3)/2
  • Number of straight lines from n points with m collinear = ⁿC₂ - ᵐC₂ + 1

Shortcut Methods to Solve Faster

Triangles = total combinations - sum of combinations from collinear sets
Lines = total combinations - sum of (ᵐC₂ - 1) for each collinear set
Diagonals of polygon = n(n-3)/2
Intersection points of diagonals of convex polygon = ⁿC₄

Common Mistakes to Avoid

Forgetting to subtract collinear combinations for triangles
Over-subtracting for lines (collinear points contribute 1 line, not ᵐC₂ lines)
Not considering that collinear points affect line count differently
Using permutation instead of combination (order doesn't matter for lines/triangles)

Exam Importance

Geometrical Combinations is an important topic for various competitive exams. Here's how frequently it appears:

SSC CGL
1-2 questions
BANKING PO
1-2 questions
RAILWAYS RRB
1-2 questions
CAT
0-1 questions
INSURANCE
1-2 questions

Ready to Master Geometrical Combinations?

Start with Worksheet 1 and work your way up to expert level! Each worksheet includes:

20 practice questions
Detailed solutions
Step-by-step explanations
Start Practicing Now