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

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

2n + 1 < 2n , for all natural numbers n ≥ 3.

1 Answer

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

Let P(n) be the given statement, i.e., P(n) : (2n + 1) < 2n for all natural numbers, n ≥ 3. We observe that P(3) is true, since 

2.3 + 1 = 7 < 8 = 23 

Assume that P(n) is true for some natural number k, i.e., 2k + 1 < 2k 

To prove P(k + 1) is true, we have to show that 2(k + 1) + 1 < 2k+1. Now, we have 2(k + 1) + 1 = 2 k + 3 

= 2k + 1 + 2 < 2k + 2 < 2k . 2 = 2k + 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 natural numbers, n ≥ 3.

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.

...