R.K.MALIKS ° NEWTON CLASSES JEE (MAIN & ADV.), MEDICAL + BOARD, NDA, IX & X CHAPTER 4: PRINCIPLE OF MATHEMATICAL INDUCTION In your daily life, you must be using various kinds of reasoning depending on the situation you are faced with, For instance, if you are told that your friend just has a child, you would know that itis either a girl or a boy. In this case, you would be applying general principles to a particular case. This form of reasoning is an example of deductive logic. ‘Now let us consider another situation. When you look around, you find students who study regularly, do well in examinations, you may formulate the general rule (rightly or wrongly) that “any one who studies regularly will do well in examinations”. In this case, you would be formulating a general principle (or rule) based on several particular instances. Such reasoning is inductive, a process of reasoning by which general rules are discovered by the observation and consideration of several individual cases, Such reasoning is used in all the sciences, as well as in Mathematics, Mathematical inductionisa more precise form of this process. This precisionis required because statement is accepted to be true mathematically only ifit can be shown to be true for each and every case that it refers to. In the present chapter, first of all we shall introduce you with a statement and then we shall introduce the concept of principale of Mathematical induction, which we shall be using in proving some statements LXey ws) After studying this lesson, you will be able to: @ — Tocheck whether the given sentence isa statement or not, @ state the Principle of Mathematical Induction; @ verify the truth or otherwise of the statement P(n) for n @ verify P(k+1) is true, assuming that P(k) is true; @ use principle of mathematical induction to establish the truth or otherwise of mathematica statement ECTED BACKGROUND KNOWLEDGE @ Number System @ Four fundamental operations on numbers and expressions, Office : 606, 6th Floor, Hariom Tower, Circular Road, Ranchi -834001, Ph.: 0651-2562523, 9835508812, 8507613968}PRINCIPLE OF MATHEMATICAL INDUCTION 10.1 WHAT IS A STATEMENT ? In your daily interactions, you must have made several assertions in the form of sentences. Of these assertions, the ones that are either true or false are called statement or propositions. For instance, “Tam 20 years old” and “Ifx= 3, then.x*=9” are statements, but ‘When will you leave ?” And ‘How wonderful!” are not statements, Notice that a statement has to bea definite assertion which can be true or false, but not both. For example, ‘x - 5 =7’ is not a statement, because we don't know what x, is. If x = 12, itis true, but ifx =5, “itis not true. Therefore, ‘x 5 =7° is not accepted by mathematicians as a statement. But both ‘x=5 =7 > x=12' and x~5=7 for any real number x’ are statements, the first one true and the second one false. wricn of the following sentences is a statement? (i India has never had a woman President, , an even number. i) x"> 1, (iv) (at BY + 2ab + bt Solution : (i) and (i) are statements, (i) being true and (ii being false. (ii) isnot a statement, since we can not determine whether it is true or false, unless we know the range of values that x and can take. Now look at (iv). At first glance , you may say that it is not a statement, for the very same reasons that (iii) is not. But look at (iv) carefully. It is true for any value of@ and 6. It isan identity. Therefore, in this case, even though we have not specified the range of values fora and 4, (iv) isa statement, ‘Some statements, like the one given below are about natural numbers in general. Let us look at the statement n(n) 1424.4 = This involves a general natural number”, Let us call this statement P (n) [P stands for proposition]. 1+) Then P (1) would be != > 2241) Similarly, P (2) would be the statement , 1+ 2 = and so on 2 Let us look at some examples to help you get used to this notation. Ey (n) denotes 3°> 1-1, write P (1), P (&) and P (+1), where & eN Solution : Replacing » by I, kand k + 1, respectively in P (7), we get Office : 606, 6th Floor, Hariom Tower, Circular Road, Ranc] 834001, (0651-2562523, 9835508812, 8507613968)PRINCIPLE OF MATHEMATICAL INDUCTION P(1):2!>2-1,ie,2>1,P (2! >k-1 P(k+ 1): 28+! >(k+1)- Lie, 2° >k PRAT ie (is the statement “1 +4+7+ Gn—2) = ZGu= 2 write P(1), P(e) and P(k+ 1), Solution : To write P(1), the terms on the left hand side (LHS) of (1) continue till 3x 1-2, ie, 1. So, P (1) will have only one term in its LHS, ie., the first term. 3x11) 1, Therefore, P(1) is Also, the right hand side (RHS)of P(1) Replacing by 2, we get 1) PQ):144 sie, 5=5 Replacing m by k and k + 1, respectively, we get kGk-1) PUR) AFA +7. + R= 2) = (ADB +D=1) > P(k+M 144474... + Gk-2)+B (k+ 1)-2]= (k+1) ie 1+4+74.. + Gk+ 1) = 3k +2) 2 10.2 The Principle of Mathematical Induction: Let P(7) bea statement involving a natural number. If (iitistme form = 1, i.e, PC) istrue; and (ii) assuming k> 1 and P(A) to be true, it can be proved that P(k+ 1)is true; then P(n) must be true for every natural number 7. Note that condition (ii) above does not say that P(K) és true. It says that whenever P(k) is true, then P(k + 1) is true’. Office : 606, 6th Floor, Hariom Tower, Ci 4 73) 5 1-2562523, 9835508812, 8507613968}PRINCIPLE OF MATHEMATICAL INDUCTION Let us se, for example, how the principle of mathematical induction allowsus to conclude that P(nyistruefor n= 11. By (i) P(1) is true. As P(1) is true, we can put k = 1 in(ii), So PU. + 1), ie., P(2)istrue. As PQ) is true, we can put & 2 in (ji) and conclude that P(2+1),ie., PG) istrue, Now put k= 3 in ii), so we get that P(4) istrue. Itis now clear that if we continue like this, we shall get that P(11) is true Itisalso clear that in the above argument, 11 does not play any special role. We can prove that P(137) is truein the same way. Indeed, it is clear that P(») is true for all” > 1 n PREETI] Prove that, 1+ 2+3+--t n= 2 (+ 1), where ris a natural number. n Solution: We have , P(n):1+2+3+..+n=F(n+ 1) 1 Therefore, P(1) is‘1 = 5 (1+1),, whichis tue,. Therefore, P(1)s true Let us now see, is P(k + 1) true whenever P(K) i k Let us, therefore, assume that P(A) is true, ie, 1+2+3...+4= S(k+1) Ai) _ (k+ kh +2) - 2 Now, Pk +I) is +2434... +k + (+ 1) It willbe true, if we can show that LHS = RHS The LHS of P(k + 1)=(1+243...+8) + (41) = Sk 1) +41) [From ()] (k++ IK +2) 2 (k =e Dt) = =RHS of P (k +1) 2) So, P(k + 1)is true, ifwe assume that P(k) is true ince P(1) is also true, both the conditions of the principle of mathematical induction are fulfilled, ‘we conclude that the given statement is true for every natural number7. Asyou can see, we have proved the result in three steps ~ the basie step [ie., checking (i)], the Induction step [i.e., checking (ii)], and hence arriving at the end result. Office : 606, 6th Floor, Hariom Tower, Circular Road, Ranchi -834001, Ph.: 0651-2562523, 9835508812, 8507613968|PRINCIPLE OF MATHEMATICAL INDUCTION For every natural number 7, prove that (x°""' + y*""') is divisibleby (x-+), where x, ye N. Solution: Let us see if we can apply the principle of induction here. Let us call P(n) the statement *(x°"" +°™" is divisible by (+), Then P(1)is* (x7? +" s divisible by (x +)’ i.e, (+) isdivisible by (x+y), whichis true. Therefore, P(1) is true Let us now assume that (A) is true for some natural number k, i.e., (x! by (x+y) + yj isdivisible ‘This means that for some natural number /, x! + y"*"! =(x+y)t Then, x =(x+ y)tay™? We wish to prove that P (k +1) istrue, ie., *[x7" + y°4"?" ]is divisible by (xi-y)"is true. Now, PDA yr Lge ax(xty)t-x'y =x (xty)t— yO? Het PPt= Ory) 77] which is divisible by (x+y). Thus, P (+1) is true. Hence, by the principle of mathematical induction, the given statements true for every natural number 1. Puta lu| Prove that 2" > 7 forevery natural number 7. Solution: We have P(7t): 2" > n. Therefore, P(1):2!> 1, Le, 2> 1, which is true. We assume P(k) to be true, that is, 2>k @ We wish to prove that P(k 1)is true, ie. 2*'> A+ 1 Now, multiplying both sides of i) by2, we get, 2*°!> 2k => 2!''> k+1, since k > 1. Therefore, P(k + 1) is true. Office 06, 6th Floor, Hariom Tower, Circular Road, Ran 83400: 1562523, 9835508812, 8507613968]PRINCIPLE OF MATHEMATICAL INDUCTION Hence, by the principle of mathematical induction, the given statement is true for every natural number 7. Sometimes, we need to prove a statement for all natural numbers greater than a particular natural number, say a (as in Example 10.7 below). In such a situation, we replace P(1) by P(a + 1)inthe statement of the principle. p> 2(n+ 1) for all n> 3, where nis a natural number. Solution: For > 3, let us call the given statement, (1): 1° >2(n 1) Since we have to prove the given statement for > 3, the first relevant statement is P(3) We, therefore, see whether (3) is true PGR):3>2 x 4ie.9>8. So, P(3)is true Let us assume that P(A) is true, where & 23, that is , > 2(k + 1) @ We wish to prove that P (k + 1)istrue P(k+1)2(k+ 1) > 2k +2) LHS of P (k + 1) =(k + 1? >2(k+ 142k +1 [By (i) ] >3+2k +, since 2 (k+1)>3.=2(k+2), Thus, (k + 1)?>2(k-+2). Therefore, P(k + 1) is true. Hence, by the principle of mathematical induction, the given statement is true for every natural number 2 > 3 PRPETEELEY Using principle of mathematical induction, prove that “PW (t 75) isa natural number, 15) 7 _345+7_15_ is 15 1d on, St5 1, which is a natural number s P()istrue Office : 606, 6th Floor, Hariom Tower, Circular Road, Ranchi -834001, 1562523, 9835508812, 8507613968]PRINCIPLE OF MATHEMATICAL INDUCTION ew Tk Let P(&) = \ is anatural numberbetrue ...(i) 7 3 +) +I kD) wes 3 15 No’ at fh +544 +108? +108? «5k + |= ) ( a (e420 43n2 428) (244472 15 (59315 TENG (4 4 2h 43h? Ast #26 43K 42K)+1 iy Kk, 3s isa natural number. also 4“ + 2k° +3? + 24 isa natural number and 1 is also a natural number. (ii) being sum of natural numbers is a natural number P(k + Lis true, whenever P(A) is true P()istrue forall natural numbers (nw In) Hence, 754 Ta is anatural number forall natural numbers n. LET US SUM U @ Sentences which are either true or false are called statement or propasitions @ The word induction means, formulating a general principle (or rule) based on several particular instances, © Thestatement of the principle of mathematical indetion. P (n), a statement involving a natural number n, is true for all 7 > 1, where nis a fixed natural number, if @ P(1)is true, and a) whenever P (k) is true, then P (K+1) is truefor ken 1562523, 9835508812, 8507613968] Office : 606, 6th Floor, Hariom Tower,