1
You visited us
1
times! Enjoying our articles?
Unlock Full Access!
Byju's Answer
Standard XII
Mathematics
Proof by mathematical induction
Prove by indu...
Question
Prove by induction:
1
+
3
+
5
+
.
.
.
.
.
+
(
2
n
−
1
)
=
n
2
Open in App
Solution
The statement to be proved is:
P
(
n
)
=
1
+
3
+
5
+
.
.
.
+
(
2
n
−
1
)
=
n
2
Step 1: Veriy that
P
(
1
)
is correct:
P
(
1
)
:
2
(
1
)
−
1
=
1
2
P
(
1
)
:
1
=
1
Therefore it is verified that
P
(
1
)
is correct.
Step 2: Assume that
P
(
k
)
is true
Let us assume that:
P
(
k
)
:
1
+
3
+
5
+
.
.
.
+
(
2
k
−
1
)
=
k
2
holds.
Step 3: Prove that
P
(
k
+
1
)
is true.
L
H
S
=
1
+
3
+
5
+
.
.
.
+
(
2
(
k
+
1
)
−
1
)
=
P
(
k
)
+
(
2
k
+
1
)
=
k
2
+
2
k
+
1
=
(
k
+
1
)
2
=
R
H
S
Hence,
P
(
n
)
is true by Principle of Mathematical Induction
Suggest Corrections
0
Similar questions
Q.
Use mathematical induction to prove:
1
1
⋅
3
+
1
3
⋅
5
+
1
5
⋅
7
+
…
+
1
(
2
n
−
1
)
(
2
n
+
1
)
=
n
2
n
+
1
Q.
Prove the following by using the principle of mathematical induction for all
n
∈
N
(
1
+
3
1
)
(
1
+
5
4
)
(
1
+
7
9
)
⋯
(
1
+
(
2
n
+
1
)
n
2
)
=
(
n
+
1
)
2
Q.
Prove the following by using the principle of mathematical induction for all n ∈ N: