Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
1.5k views
in Mathematical Induction by (49.0k points)
closed by

Prove statement, by using the Principle of Mathematical Induction for all n ∈ N, that :

1 + 3 + 5 + ... + (2n – 1) = n2

1 Answer

+1 vote
by (50.4k points)
selected by
 
Best answer

Let the given statement P(n) be defined as P(n) : 1 + 3 + 5 +...+ (2n – 1) = n2 , for n ∈ N. Note that P(1) is true, since 

P(1) : 1 = 12 

Assume that P(k) is true for some k ∈ N, i.e., 

P(k) : 1 + 3 + 5 + ... + (2k – 1) = k2 

Now, to prove that P(k + 1) is true, we have 

1 + 3 + 5 + ... + (2k – 1) + (2k + 1) 

= k2 + (2k + 1)

= k2 + 2k + 1 = (k + 1)

Thus, P(k + 1) is true, whenever P(k) is true. Hence, by the Principle of Mathematical Induction, P(n) is true for all n ∈ N.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

...