Last updated at Dec. 16, 2024 by Teachoo
Question21 Prove the following by using the principle of mathematical induction for all n โ N: x2n โ y2n is divisible by ๐ฅ + ๐ฆ. Let P(n): x2n โ y2n = (x + y) ร d, where d โ N For n = 1 L.H.S = x2 ร 1 โ y2 ร 1 = x2 โ y2 = (x + y) (x โ y) = R.H.S โด P(n) is true for n = 1 Assume P(k) is true x2k โ y2k = m (x + y), where m โ N We will prove that P(k + 1) is true. L.H.S = x2(k+1) - y2(k+1) = x2k+2 - y2k+2 = x2k . x2 โ y2k . y2 = x2 (m(x + y) + y2k) โ y2k . y2 = x2 (m (x + y)) + x2 y2k โ y2k . Y2 = x2 (m (x + y)) + y2k (x2 โ y2) = x2 (m (x + y)) + y2k (x + y) (x โ y) = (x + y) [m.x2 + y2k (x โ y)] = (x + y) ร r where r = m.x2 + y2k (x - y) is a natural number โด 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
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 You are here
Question 22
Question 23 Important
Question 24 Important
About the Author
Davneet Singh has done his B.Tech from Indian Institute of Technology, Kanpur. He has been teaching from the past 14 years. He provides courses for Maths, Science and Computer Science at Teachoo