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
271 views
in Combinatorics and Mathematical Induction by (49.2k points)
closed by

n2 < 2n, for all natural numbers n ≥ 5

1 Answer

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

Let P(n) : n2 < 2n for all natural numbers, n ≥ 5 

Step 1 : 

P(5) : 15 < 25 ⇒ 1 < 32 which is true for P(5) 

Step 2 :

P(k): k2 < 2k. Let it be true for k ∈ N 

Step 3 : 

P(k + 1): (k + 1)2 < 2k + 1

From Step 2, we get k2 < 2k 

⇒ k2 < 2k + 1 < 2k + 2k + 1

From eqn. (i) and (ii), we get (k + 1)2 < 2k + 1 

Hence, P(k + 1) is true whenever P(k) is true for k ∈ N, n ≥ 5.

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.

...