By Fatskills Exam Guides Team — the exam nerds behind 28,500+ quizzes and 2.1M practice questions across 500+ global exams.
Mastering Mathematical Induction and Inequalities unlocks 10-15 marks in IIT JEE (Main + Advanced) – enough to push you from a 90th to a 99th percentile rank. These techniques solve problems where algebra alone fails, like proving nested inequalities, optimization, and divisibility in seconds.
<
>
≤
≥
Σ
n=1
n=k
n=k+1
1 + 2 + ... + n = n(n+1)/2
1 = 1(2)/2
1+...+k = k(k+1)/2
k+1
(x-1)(x-2) > 0
(a+b)/2 ≥ √(ab)
a=4, b=1
(4+1)/2 ≥ √(4×1)
2.5 ≥ 2
(a₁b₁ + a₂b₂ + ... + aₙbₙ)² ≤ (a₁² + ... + aₙ²)(b₁² + ... + bₙ²)
a=1, b=2
(1×2)² ≤ (1²)(2²)
4 ≤ 4
P(1)
P(k)
P(k+1)
MEMORISE THIS – The structure is always the same.
For non-negative real numbers a₁, a₂, ..., aₙ: (a₁ + a₂ + ... + aₙ)/n ≥ (a₁a₂...aₙ)^(1/n) Equality holds when all aᵢ are equal.
a₁, a₂, ..., aₙ
(a₁ + a₂ + ... + aₙ)/n ≥ (a₁a₂...aₙ)^(1/n)
aᵢ
MEMORISE THIS – Most useful for 2 or 3 variables in JEE.
For real numbers a₁, a₂, ..., aₙ and b₁, b₂, ..., bₙ: (a₁b₁ + a₂b₂ + ... + aₙbₙ)² ≤ (a₁² + a₂² + ... + aₙ²)(b₁² + b₂² + ... + bₙ²) Equality holds when aᵢ = λbᵢ for some constant λ.
b₁, b₂, ..., bₙ
(a₁b₁ + a₂b₂ + ... + aₙbₙ)² ≤ (a₁² + a₂² + ... + aₙ²)(b₁² + b₂² + ... + bₙ²)
aᵢ = λbᵢ
λ
MEMORISE THIS – Often used in optimization problems.
MEMORISE THIS – Works for polynomial and rational inequalities.
P(n)
P(n): 1 + 3 + 5 + ... + (2n-1) = n²
n ∈ ℕ
> 0
< 0
≥ 0
≤ 0
x=1, x=2
1
2
x=0
x=1.5
x=3
x ∈ (-∞, 1) ∪ (2, ∞)
a + 1/a ≥ 2
a > 0
(a + 1/a)/2 ≥ √(a × 1/a) = 1
a = 1/a
a = 1
(a₁, a₂, ..., aₙ)
(b₁, b₂, ..., bₙ)
x + 2y
x² + y² = 1
(x×1 + y×2)² ≤ (x² + y²)(1² + 2²)
(x + 2y)² ≤ (1)(5) = 5
x + 2y ≤ √5
x/1 = y/2
y = 2x
x = ±1/√5
y = ±2/√5
Problem: Prove 1 + 2 + 3 + ... + n = n(n+1)/2 for all n ∈ ℕ.
1 + 2 + 3 + ... + n = n(n+1)/2
Solution: 1. Base Case (n=1): - LHS = 1 - RHS = 1(2)/2 = 1 - LHS = RHS → True. 2. Inductive Hypothesis (n=k): - Assume 1 + 2 + ... + k = k(k+1)/2. 3. Inductive Step (n=k+1): - LHS = 1 + 2 + ... + k + (k+1) - = k(k+1)/2 + (k+1) (using hypothesis) - = (k+1)(k/2 + 1) = (k+1)(k+2)/2 - RHS = (k+1)(k+2)/2 - LHS = RHS → True. 4. Conclusion: - By induction, the statement holds for all n ∈ ℕ.
1(2)/2 = 1
1 + 2 + ... + k = k(k+1)/2
1 + 2 + ... + k + (k+1)
k(k+1)/2 + (k+1)
(k+1)(k/2 + 1) = (k+1)(k+2)/2
(k+1)(k+2)/2
What we did and why: - We followed the 3-step induction process (Base, Hypothesis, Step). - The key was substituting the hypothesis into the k+1 case.
Problem: Solve (x-1)(x+2)/(x-3) ≤ 0.
(x-1)(x+2)/(x-3) ≤ 0
Solution: 1. Rewrite in standard form: - (x-1)(x+2)/(x-3) ≤ 0 2. Find critical points: - Numerator roots: x = 1, x = -2 - Denominator root: x = 3 (excluded, causes vertical asymptote) 3. Plot on number line: - -∞ ... -2 ... 1 ... 3 ... ∞ 4. Test intervals: - x = -3: (-4)(-1)/(-6) = -4/6 < 0 → Negative - x = 0: (-1)(2)/(-3) = 2/3 > 0 → Positive - x = 2: (1)(4)/(-1) = -4 < 0 → Negative - x = 4: (3)(6)/(1) = 18 > 0 → Positive 5. Shade regions where ≤ 0: - Includes -2 and 1 (since ≤ allows equality). - Excludes 3 (denominator zero). 6. Solution: - x ∈ [-2, 1] ∪ (3, ∞)
x = 1, x = -2
x = 3
-∞ ... -2 ... 1 ... 3 ... ∞
x = -3
(-4)(-1)/(-6) = -4/6 < 0
x = 0
(-1)(2)/(-3) = 2/3 > 0
x = 2
(1)(4)/(-1) = -4 < 0
x = 4
(3)(6)/(1) = 18 > 0
-2
3
x ∈ [-2, 1] ∪ (3, ∞)
What we did and why: - We plotted critical points and tested intervals to determine where the inequality holds. - Denominator roots are always excluded (undefined).
Problem: If a, b, c > 0 and a + b + c = 1, prove 1/a + 1/b + 1/c ≥ 9.
a, b, c > 0
a + b + c = 1
1/a + 1/b + 1/c ≥ 9
Solution: 1. Apply AM-HM (a variant of AM-GM): - For positive numbers, (a + b + c)/3 ≥ 3/(1/a + 1/b + 1/c) 2. Substitute a + b + c = 1: - 1/3 ≥ 3/(1/a + 1/b + 1/c) 3. Take reciprocals (reverse inequality since both sides positive): - 3 ≤ (1/a + 1/b + 1/c)/3 4. Multiply by 3: - 9 ≤ 1/a + 1/b + 1/c - Thus, 1/a + 1/b + 1/c ≥ 9.
(a + b + c)/3 ≥ 3/(1/a + 1/b + 1/c)
1/3 ≥ 3/(1/a + 1/b + 1/c)
3 ≤ (1/a + 1/b + 1/c)/3
9 ≤ 1/a + 1/b + 1/c
Equality condition: - Holds when a = b = c = 1/3.
a = b = c = 1/3
What we did and why: - We used AM-HM (a direct consequence of AM-GM) to relate the sum and reciprocals. - The key was recognizing the constraint a + b + c = 1 to substitute.
n=2
n ≥ 2
n
|x|
√x
x ≥ 0
x < 0
a + b = 1
Listen up! Tonight, before your exam, remember this:
Done! The statement is true for all n.
Wavy Curve = 4 steps:
Never include denominator roots!
AM-GM = 2 steps:
(a + b)/2 ≥ √(ab)
a = b
Works only for non-negative numbers!
Cauchy-Schwarz = 3 steps:
(a₁b₁ + ... + aₙbₙ)² ≤ (a₁² + ... + aₙ²)(b₁² + ... + bₙ²)
Final tip: In JEE, inequalities often hide in optimization problems. If you see "maximum" or "minimum," think AM-GM or Cauchy-Schwarz first.
Now go crush that exam! ?
Join 4M+ learners. Unlock unlimited quizzes, wrong-answer tracking, flashcards + reminders, study guides, and 1-on-1 challenges.