Mathematical Induction - Questions and Solutions
Question 2
Question 3 Important
Question 4
Question 5 Important
Question 6
Question 7 Important
Question 8 Important
Question 9
Question 10
Question 11 Important
Question 12
Question 13 Important
Question 14
Question 15 Important
Question 16 Important
Question 17 Important
Question 18 Important
Question 19
Question 20
Question 21 Important
Question 22
Question 23 Important
Question 24 Important You are here
Last updated at April 16, 2024 by Teachoo
Question24 Prove the following by using the principle of mathematical induction for all n, n is a natural number (2n +7) < (n + 3)2 Introduction Since 1 < 100 then 1 < 100 + 5 i.e. 1 < 105 We will use this theory in our question Question24 Prove the following by using the principle of mathematical induction for all n, n is a natural number (2n +7) < (n + 3)2 Let P(n): (2n +7) < (n + 3)2 For n = 1 L.H.S = (2.1 + 7) = 2 + 7 = 9 R.H.S = (1 + 3)2 = 16 Since 9 < 16 L.H.S < R.H.S P(n) is true for n = 1 Assume P(k) is true (2k + 7) < (k + 3)2 We will prove that P(k + 1) is true. R.H.S = ((k+1) + 3)2 L.H.S = (2(k+1) + 7) L.H.S < R.H.S P(k + 1) is true whenever P(k) is true. By the principle of mathematical induction, P(n) is true for n, where n is a natural number