## Counting In Geometry!

# Counting in Geometry

(a) In a plane, if there are n points of which no three are collinear, then

- The number of straight lines that can be formed by joining them is
^{n}C_{2}. - The number of triangles that can be formed by joining them is
^{n}C_{3}. - The number of polygons with k sides that can be formed by joining them is
^{n}C_{k}.

(b) In a plane, if there are n points out of which m points are collinear, then

- The number of straight lines that can be formed by joining them is
^{n}C_{2}–^{m}C_{2}+ 1. - The number of triangles that can be formed by joining them is
^{n}C_{3}–^{m}C_{3}. - The number of polygons with k sides that can be formed by joining them is
^{n}C_{k}–^{m}C_{k}.

(c) The number of diagonals of an n sided polygon is ^{n}C_{2} – n = n × (n – 3)/2

(d) The number of triangles that can be formed by joining the vertices of an n-sided polygon which has,

- Exactly one side common with that of the polygon is n × (n – 4).
- Exactly two sides common with that of the polygon are n.
- No side common with that of the polygon is n × (n – 4) × (n – 5)/6.

(e) The number of parallelograms formed if ‘x’ lines in a plane are intersected by ‘y’ parallel lines is x × y × (x – 1) × (y – 1)/4.

(f) If there are n lines drawn in a plane such that no two of them are parallel and no three of them are concurrent, then the number of different points at which these lines will intersect each other is ^{n}C_{2} = n × (n – 1)/2.

(g) If there are n straight lines in a plane with no two of them parallel to each other, no three passing through the same point and their points of intersection are joined, then the number of new lines obtained are n × (n – 1) × (n – 2) × (n – 3)/8.

(h) The sides of a triangle a, b and c are integers where a ≤ b ≤ c. If c is given, then the number of different triangles is c × (c + 2)/4 or (c + 1)2/4, depending on whether c is even or odd. Also, the number of isosceles triangles is (3c – 2)/2 or (3c – 1)/2, depending on whether c is even or odd.

(i) In a square grid of n × n,

- The number of rectangles of any size is ∑r³.
- The number of squares of any size is ∑r².

(j) In a rectangular grid of p × q (p < q),

- The number of rectangles of any size is p × q × (p + 1) × (q + 1) / 4.
- The number of squares of any size is ∑ [(p + 1 – r) × (q + 1 – r)].

(k) If n straight lines are drawn in a plane such that no two lines are parallel and no three lines are concurrent, then the number of parts these lines divide the plane into is equal to [n × (n + 1)/2] + 1.

(l) If “n” parallel lines are passing through a circle, dividing the plane into distinct non-overlapping bounded or unbounded regions, then the maximum number of regions the plane can be divided into is (3n + 1).

## Solve the problem of the day

Quant Question Of The Day : 18/06/2018

Quant Question Of The Day : 17/06/2018

## 6 comments