Skip to content
Question 113 of 134

Q.(a) By the principle of Mathematical Induction, prove that for n≥1n \ge 1, 1⋅2+2⋅3+3⋅4+…n(n+1)=n(n+1)(n+2)31\cdot2 + 2\cdot3 + 3\cdot4 + \ldots n(n+1) = \dfrac{n(n+1)(n+2)}{3}. OR

(b) In a △ABC\triangle ABC, prove that asin⁡(B−C)b2−c2=bsin⁡(C−A)c2−a2=csin⁡(A−B)a2−b2\dfrac{a\sin(B-C)}{b^2-c^2} = \dfrac{b\sin(C-A)}{c^2-a^2} = \dfrac{c\sin(A-B)}{a^2-b^2}.
Puducherry TnboardTamil Nadu HSC First Year (DGE) Board 2020Subjective· 5mImportance★★★★★
84% · 113/134 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

Verified for n=1, then shown that if the formula holds for n=k it must hold for n=k+1, so by mathematical induction it holds for every n≥1n \ge 1.

Let P(n)P(n): 1⋅2+2⋅3+3⋅4+…+n(n+1)=n(n+1)(n+2)31\cdot2+2\cdot3+3\cdot4+\ldots+n(n+1) = \dfrac{n(n+1)(n+2)}{3}.

Base case (n=1): LHS =1⋅2=2=1\cdot2=2. RHS =1⋅2⋅33=2=\dfrac{1\cdot2\cdot3}{3}=2. So P(1)P(1) is true.

Inductive hypothesis: Assume P(k)P(k) is true for some k≥1k\ge1:

1⋅2+2⋅3+…+k(k+1)=k(k+1)(k+2)31\cdot2+2\cdot3+\ldots+k(k+1) = \dfrac{k(k+1)(k+2)}{3}

Inductive step: Show P(k+1)P(k+1) holds. Add the next term (k+1)(k+2)(k+1)(k+2) to both sides:

1⋅2+…+k(k+1)+(k+1)(k+2)=k(k+1)(k+2)3+(k+1)(k+2)1\cdot2+\ldots+k(k+1)+(k+1)(k+2) = \dfrac{k(k+1)(k+2)}{3}+(k+1)(k+2)

Factor out (k+1)(k+2)(k+1)(k+2) on the right: …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.