Skip to content
Question of 114

Q.By principle of mathematical induction prove that 13+23+33+……+n3=[n(n+1)2]21^3+2^3+3^3+\ldots\ldots+n^3=\left[\dfrac{n(n+1)}{2}\right]^2 OR For every positive integer nn, prove that 7n−3n7^n - 3^n is divisible by 4.

Meghalaya MboseMBOSE Meghalaya 11th Board 2019Subjective· 4mImportance★★★★★
0% · 0/114 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 →

By the principle of mathematical induction, 13+23+⋯+n3=[n(n+1)2]21^3+2^3+\cdots+n^3=\left[\dfrac{n(n+1)}{2}\right]^2 holds for every natural number nn.

Let P(n)P(n) be the statement: 13+23+33+⋯+n3=[n(n+1)2]21^3+2^3+3^3+\cdots+n^3=\left[\dfrac{n(n+1)}{2}\right]^2

Step 1: Base case (n=1n=1)

LHS =13=1=1^3=1

RHS =[1(1+1)2]2=[22]2=12=1=\left[\dfrac{1(1+1)}{2}\right]^2=\left[\dfrac{2}{2}\right]^2=1^2=1

LHS == RHS, so P(1)P(1) is true.

Step 2: Inductive step

Assume P(k)P(k) is true for some k∈Nk\in\mathbb{N}, i.e.

13+23+⋯+k3=[k(k+1)2]21^3+2^3+\cdots+k^3=\left[\dfrac{k(k+1)}{2}\right]^2 ... (assumption)

We must show P(k+1)P(k+1) is true:

13+23+⋯+k3+(k+1)3=[(k+1)(k+2)2]21^3+2^3+\cdots+k^3+(k+1)^3=\left[\dfrac{(k+1)(k+2)}{2}\right]^2

Starting from the LHS and using the assumption:

13+23+⋯+k3+(k+1)3=[k(k+1)2]2+(k+1)31^3+2^3+\cdots+k^3+(k+1)^3 = \left[\dfrac{k(k+1)}{2}\right]^2 + (k+1)^3

Factor out (k+1)2(k+1)^2:

=(k+1)2[k24+(k+1)]=(k+1)2[k2+4k+44]=(k+1)2⋅(k+2)24= (k+1)^2\left[\dfrac{k^2}{4}+(k+1)\right] = (k+1)^2\left[\dfrac{k^2+4k+4}{4}\right] = (k+1)^2\cdot\dfrac{(k+2)^2}{4}

=[(k+1)(k+2)2]2= \left[\dfrac{(k+1)(k+2)}{2}\right]^2

This is exactly the RHS of P(k+1)P(k+1). So P(k+1)P(k+1) is true whenever P(k)P(k) is true.

Step 3: Conclusion …

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.