No products in the cart.

(2n+7)>(n+3)² prove by mathematical induction

CBSE, JEE, NEET, CUET

CBSE, JEE, NEET, CUET

Question Bank, Mock Tests, Exam Papers

NCERT Solutions, Sample Papers, Notes, Videos

(2n+7)>(n+3)² prove by mathematical induction
  • 1 answers

Sia ? 6 years, 4 months ago

Let P (n) =(2n + 7) < (n + 3)2
For n = 1
{tex}P(1) = (2 \times 1 + 7) < {(1 + 3)^2} \Rightarrow 9 < 16{/tex}
{tex}\therefore {/tex} P ( 1) is true
Let P(n) be true for n = k
{tex}\therefore P(k) = (2k + 7) < {(k + 3)^2}{/tex} ....(1)
For n = k + 1 
P (k + 1) = 2 (k + 1) + 7 < (k + 1 + 3)2
{tex} \Rightarrow {/tex} 2(k + 1) + 7 < (k + 4)2
From (1)
2k + 7 < (k + 3)2
Adding 2 on both sides
2k + 7 + 2 < (k + 3)2 + 2 {tex} \Rightarrow {/tex} 2(k + 1) + 7 < k2 + 9 + 6k + 2
{tex} \Rightarrow {/tex} 2(k + 1) + 7 < k2 +6k + 11 < k2 + 8k + 16
2(k + 1) + 7 <(k + 4)2
{tex}\therefore {/tex} P (k + 1) is true
Thus P(k) is true {tex} \Rightarrow {/tex} P(k + 1) is true
Hence by principle of mathematical induction, P (n) is true for all {tex}n \in N{/tex}.

https://examin8.com Test

Related Questions

Square of 169
  • 1 answers
Ch 1 ke questions
  • 1 answers
Find the product. (4x²) (–5³)
  • 0 answers
Express the complex number i-39
  • 0 answers
(3+i)x + (1-2i) y +7i =0
  • 1 answers
2nC2:nC3=33:10
  • 0 answers

myCBSEguide App

myCBSEguide

Trusted by 1 Crore+ Students

Test Generator

Test Generator

Create papers online. It's FREE.

CUET Mock Tests

CUET Mock Tests

75,000+ questions to practice only on myCBSEguide app

Download myCBSEguide App