Step 1: Assume given statement
Let the given statement be P(n), i.e.
P(n):12+22+32+42+…+n2=n(n+1)(2n+1)6
Step 2: Checking statement P(n) for n=1
Put n=1 in P(n), we get
P(1):12=1(1+1)(2⋅1+1)6
⇒1=1⋅2⋅36
⇒1=1
which is true for n=1.
Step 3: P(n) for n=k.
Put n=K in P(n), and assume that P(K) is true for some positive integer K i.e.,
P(K):12+22+32+42+…+K2=K(K+1)(2K+1)6 ⋯(1)
Step (4): Checking statement P(n) for n=K+1
Now, we shall prove that P(K+1) is also true whenever P(K) is true.
Put n=K+1 in given statement.
12+22+32+42+…+K2+(K+1)2
=K(K+1)(2K+1)6+(K+1)2
=K(K+1)(2K+1)+6(K+1)26
=(K+1)(2K2+K+6K+6)6
=(K+1)(2K2+7K+6)6
=(K+1)(2K2+4K+3K+6)6
=(K+1)[2K(K+2)+3(K+2)]6
=(K+1)(K+2)(2K+3)6
=(K+1)(K+1+1)(2(K+1)+1)6
Thus, P(K+1) is true, whenever P(K) is true.
Final Answer:
Hence, from the principle of Mathematical Induction, the statement P(n) is true for all natural numbers n.