Base case n=1 holds (1<9/8); the inductive step shows the bound for n=k+1 equals the bound for n=k plus exactly (k+1), so the strict inequality is preserved for all n.
Note: This topic (Principle of Mathematical Induction) was a standalone NCERT chapter in earlier syllabi but has been removed from the current rationalised Class 11 syllabus — it is included here for completeness since it was asked in this year's paper.
Let P(n):1+2+3+⋯+n<81(2n+1)2.
Base case (n=1): LHS =1. RHS =81(3)2=89=1.125. Since 1<1.125, P(1) is true.
Inductive step: Assume P(k) is true: 1+2+⋯+k<81(2k+1)2.
We must show P(k+1): 1+2+⋯+k+(k+1)<81(2k+3)2.
From the inductive hypothesis,
1+2+⋯+k+(k+1)<81(2k+1)2+(k+1).
Now compare 81(2k+1)2+(k+1) with 81(2k+3)2:
(2k+3)2−(2k+1)2=[(2k+3)−(2k+1)][(2k+3)+(2k+1)]=2(4k+4)=8k+8.
So 81(2k+3)2−81(2k+1)2=88k+8=k+1.
…