Scribd Logo
Upload

Welcome to Scribd!

  • Mathematical Induction Resonance

    Uploaded by

    tanmay
    6 views8 pages
    pls use this

    Original Title

    mathematical induction resonance

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    pls use this

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    6 views8 pages

    Mathematical Induction Resonance

    Uploaded by

    tanmay
    pls use this

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 8
    \d nave Mamalels eaten ey general result from particular results is called the process of induction. ‘mathematical process which is used to establish the validity of eine 2 iain a wales Ititis either true or false but not both, she sertence “Two Plus ive equals seven” is a statement because this sentence is true. j jent concerning the natural number ‘n’ on) ar ae neat 8 general cored tn). For example tn) denctesthe (3) is the statement :*3(3 + 1) isan ev /en number" (7) isthe statement: 7(7 + 1) is an even number’ etc Hee (3) and P(7) are both true. qHE PRINCIPLE OF MATHEMATICAL INDUCTION : IfP(n) isa statement (n e N) such that ()P(1)is true and {ip truth of P(k) implies the truth of P(k + 1). Then by the principle of mathematical induction (P.M) the statement P(n) is true forall ne N. Remark: Hfagiven statement P(n) is to be proved forn=m-+1,m+2,m+3 forsomem P(m + 1)is tue Hence by the principle of mathematical induction the given result is true for alin eN. Example 5. If x and y are any two distinct integers, then prove by mathematical induction that (t= Ex divisible by (xy) forall nN. Sol. Let P(n) be the statement given by So! P(n) : (x"-y") is divisible by (xy) ‘Step-l_P(1): (x'—y') is divisible by (x—y) ~y'= (x-y)is divisible by (x —y) ©. P(1) is true Step-ll Let P(m) be true, then (x -y") is divisible by (xy) = (x"=y") = (xy) for some he Z “) Ree ee that P(m + 1)is true. For this itis sufficient to show that (xm"!-YoIe Now YP xm — ry + ny — yt eteey) yh —y™) aie) Yay) [Using (iy) (x — y) (x" + y2) which is divisible by (x-y) So P(m + 1) is true Thus P(m)istrue = P(m+ 1) is true Hence by the principle of mathematical induct le. (ys divisible by (xy) for aun aay, is true for allneN iW Resonance”. + 1)is true (sing (p] istrue = P(m+1)istrue the principle of mathematical is always 1. al Induction P(n) is true for allln € N i.e. 3 when divided by 8 the “Prove by the principle of mathematical i Let P(n) be the statement: Saag ee ae ae P(t): 1<2" <2) P(1)istrue Let P(m) be true, then m <2" ‘we shall now show that P(m + 1) is true for which we will have to prove that (m + 1) <2"** P(m)is true m<2" 2m <2.2" = 2m<2™' = (m+m)<2"! m+ism+m<2"! [etsm 2 m+tsmem) (m+1)<2""' Pim + 1)is true P(m)istrue = P(m+1)istrue So by the principle of mathematical induction P(n) is true forall n < Ni.e.n<2*foralln €N uta for all n € N. 142434 Wehave , t+ exif . 2 Payist a). 1< ee 4 ; 5 (1) is true j Let P(m) be true, then 4 (am +1F w H42+3+...+m<—g ; We shall now show that P(m + 1) is true le. faim +1) +4 14+2+3+...+m+(m+1) ss ere ES ve istrueforalln N ciple of mathematical induction PC) a atfor alin Ny 8 ewe mela) 2 sng + snag sn ++ sn d= ——"g 2 Lot Pn) be the statement given by (n+t nd si 23")osn’y P(n) : sin® + sin26 + sin36 + + sin nd = eT sine 2 Self P sind = . — P(1)istrue Step-ll Let P(m) be true, then sind + sin26 +... + sinmo = Ai) We shall now show that P(m + 1) is true ie. sind + sin20 + ; _ Masrecmes SOUS eT an etea 1 WS Geta + 1)is true P(m)istrue = P(m+1)istrue 8 by principle mathematical induction P(n) is true for alin « N . whan? 460-1) +5.7+....+(2n=1)(2n+4 ne c c a N. Ipysing PM. prove that 1.9+ 3.5 : Boog 22 + 25> civisble by 13 orn n,n EN. 21 = 2(2') =2(k + HKtk+2n>k44 f 6 Provethat 1 +2 +3 tonnntM< 5 Qt 1 neN If 32", where n is a natural number, is divided by 8, prove that the remainder is always 1 8. _Use the principle of mathematical induction to prove that nin numbers. m Resonance ng roar noae More 6, - 2 fi shui ot By crise nas RiKES)k oN (©)p(4yistrue (©) p(k + 1) is true whenever p(k) i rue where k « N _— A We) 7 nai” © Ne is true for (Oalin (oyne4 (B)n22 . EN, is true for (Byn22 (alin (D) none of these then for every natural number, x'-y°is divisible by (B)xty (x- (D)allof these {n+ 1)? + (n + 2)°is divisible for all n « Nby (8)9 (27 (081 choice type 8n-9is divisible for every natural number n by rinciple of mathematical induction, 3°" —' (C)64 (O29 (B)8 (MATHEMATICS gence : induction can be used to prove the formula 2, Forevery natural numbre n> 2 nine)

    You might also like