IIT M.Tech Admission /Quantitative Aptitude

Geometry basics

Speed & Geometry · free study notes

Geometry Basics – Quantitative Aptitude

Prepared for IIT M.Tech Admission – Advanced University Level (MIT‑style)

Goal: Build a solid, first‑principle foundation on which all quantitative geometry problems rest.
Scope: 2‑D Euclidean geometry (points, lines, planes, polygons, circles, coordinate geometry) with a focus on rigorous derivations, edge‑cases, and problem‑solving strategies.


Table of Contents

  1. Foundations
    1.1 Points, Lines, Planes
    1.2 Distance, Midpoint, Slope
    1.3 Concurrency & Collinearity
  2. Triangles & Polygons
    2.1 Triangle Inequality & Classification
    2.2 Angle Bisectors, Medians, Altitudes
    2.3 Ceva’s & Menelaus’ Theorems
    2.4 Polygon Area (Shoelace)
  3. Circles
    3.1 Tangents, Secants, Chords
    3.2 Power of a Point, Radical Axis
    3.3 Incenter, Incircle, Circumcircle, Orthocenter
  4. Coordinate Geometry
    4.1 Cartesian Transformations
    4.2 Parametric & Polar Forms
    4.3 Conic Sections – Ellipse, Parabola, Hyperbola
  5. Three‑Dimensional Extensions (brief – for completeness)
  6. Edge Cases & Degeneracies
  7. Challenging Problem & Solution

<a name="1-foundations"></a>

1. Foundations

1.1 Points, Lines, Planes

  • Point: An object with no dimensions, denoted by (P(x, y)) in the plane.
  • Line: Set of points satisfying a linear equation (ax + by + c = 0).
  • Plane: In 3‑D: (ax + by + cz + d = 0).

Key Property: Two distinct points determine a unique line; three non‑collinear points determine a unique plane.

1.2 Distance, Midpoint, Slope

  • Distance between (P_1(x_1, y_1)) and (P_2(x_2, y_2)): [ d(P_1, P_2) = \sqrt{(x_2-x_1)^2+(y_2-y_1)^2} ]
  • Midpoint: [ M!\left(\frac{x_1+x_2}{2},\frac{y_1+y_2}{2}\right) ]
  • Slope of line through (P_1, P_2): [ m = \frac{y_2-y_1}{x_2-x_1}\quad (x_2\neq x_1) ]

1.3 Concurrency & Collinearity

  • Collinear: Three points are collinear iff the determinant [ \begin{vmatrix} x_1 & y_1 & 1\ x_2 & y_2 & 1\ x_3 & y_3 & 1 \end{vmatrix} = 0 ]
  • Concurrency of (n) lines: Solve the simultaneous equations; if a unique solution exists, lines intersect at a point.

<a name="2-triangles-polygons"></a>

2. Triangles & Polygons

2.1 Triangle Inequality & Classification

  • If sides (a,b,c) satisfy (a+b>c), (a+c>b), (b+c>a) ⇒ a valid triangle.
  • Types:
    • Scalene: all sides distinct.
    • Isosceles: at least two equal sides.
    • Equilateral: all three equal.

2.2 Angle Bisectors, Medians, Altitudes

  • Median to side (a): line from opposite vertex to midpoint of (a). Length: [ m_a = \tfrac12\sqrt{2b^2+2c^2-a^2} ]
  • Angle bisector to side (a): [ t_a = \frac{2bc\cos(\tfrac{\alpha}{2})}{b+c} ]
  • Altitude to side (a): [ h_a = \frac{2\Delta}{a}\quad \text{where }\Delta\text{ is area} ]

2.3 Ceva’s & Menelaus’ Theorems

  • Ceva (for concurrency of cevians (AD, BE, CF)): [ \frac{BD}{DC}\cdot\frac{CE}{EA}\cdot\frac{AF}{FB}=1 ]
  • Menelaus (for collinearity of points (D,E,F) on sides (BC, CA, AB)): [ \frac{BD}{DC}\cdot\frac{CE}{EA}\cdot\frac{AF}{FB}=-1 ]

Proof Sketch: Use area ratios or barycentric coordinates.

2.4 Polygon Area – Shoelace Formula

For polygon with vertices ((x_i,y_i)), (i=1..n): [ \text{Area} = \frac12\left|\sum_{i=1}^{n} (x_i y_{i+1} - y_i x_{i+1})\right| ] with (x_{n+1}=x_1, y_{n+1}=y_1).
Derivation: Partition polygon into triangles with a fixed origin and sum signed areas.


<a name="3-circles"></a>

3. Circles

3.1 Tangents, Secants, Chords

  • Tangent–Chord Theorem

Your note

Page 1

Doubt hai is topic me?

Free AI teacher se poocho — 24/7, step by step.