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
2.9k views
in Mathematical Induction by (22.8k points)
closed by

Use the principle of mathematical induction to prove the following statement true for all n∈N.

x + 4x + 7x + ... + (3n – 2)x = \(\frac{1}{2}\)n(3n – 1)x.

1 Answer

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

Let T(n) be the statement: 

x + 4x + 7x + ... + (3n – 2)x = \(\frac{1}{2}\)n(3n – 1)x 

Basic Step: For n = 1, 

x = \(\frac{1}{2}\) × 1 × (3 × 1 – 1) × x ⇒ x = x ⇒ T(1) is true. 

Induction Step: Assume T(k) holds for a natural number k, i.e., 

x + 4x + 7x + ... + (3k – 2)x = \(\frac{1}{2}\)k(3k – 1)x 

Now to show that T(k + 1) holds, add the (k + 1)th term = [3(k + 1) – 2]x = (3k + 1)x to both the sides of T(k), i.e., 

x + 4x + 7x + ... + (3k – 2)x + (3k + 1)x = \(\frac{1}{2}\)k(3k – 1)x + (3k + 1)x 

= \(\frac{1}{2}\)[k(3k – 1)x + 2(3k + 1)x] = \(\frac{1}{2}\) [(3k2 + 5k + 2) x] = \(\frac{1}{2}\)(k + 1) (3k + 2) x 

= \(\frac{1}{2}\)(k + 1) [3 (k + 1) – 1] x 

T (k + 1) is true, whenever T(k) is true.

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.

...