Step (1): Assume given statement
Let the given statement be P(n), i. e.,
P(n):1+3+32+⋯+3n−1=(3n−1)2
Step (2): Checking statement P(n) for n=1
Put n=1 in P(n), we get
P(1):1=(31−1)2
⇒1=22
⇒1=1
Thus P(n) is true for n=1.
Step (3): P(n) for n=K
Put n=K in P(n) and assume this is true for some natural number K i.e.,
P(K):1+3+32+⋯+3K−1=(3K−1)2 ⋯(1)
Step (4): Checking statement P(n) for n=K+1
Now, we shall prove that P(K+1) is true
whenever P(K) is true.
Now, we have
1+3+32+⋯+3K−1+3K
=(1+3+32+⋯+3K−1)+3K
=(3K−1)2+3K (Using (1))
=3K−1+2⋅3K2
=3⋅3K−12
=3K+1−12
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 n∈N.