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.2k views
in Mathematical Induction by (44.2k points)
closed by

Prove by the method of induction, for all n ∈ N.

12 + 42 + 72 + …… + (3n – 2) = n/2(6n2 – 3n – 1)

1 Answer

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

Let P(n) = 12 + 42 + 72 + ….. + (3n – 2)2 = n/2

(6n2 – 3n – 1), for all n ∈ N.

Step I:

Put n = 1

L.H.S.= 12 = 1

R.H.S.= 1/2[6(1)2 – 3(1) – 1] = 1

∴ L.H.S. = R.H.S.

∴ P(n) is true for n = 1.

Step II:

Let us assume that P(n) is true for n = k.

∴ 12 + 42 + 72+…..+ (3k – 2)2 = k/2(6k – 3k – 1) ……(i)

Step III:

We have to prove that P(n) is true for n = k + 1

i.e., to prove that

∴ P(n) is true for n = k + 1.

Step IV:

From all the steps above, by the principle of mathematical induction, P(n) is true for all n ∈ N.

∴ 12 + 42 + 72 + … + (3n – 2)2 = n/2(6n2 – 3n – 1) 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.

...