SlideShare a Scribd company logo
1 of 26
Download to read offline
Mathematical Induction
Mathematical Induction
e.g .v  Prove 2 n  n 2 for n  4
Mathematical Induction
e.g .v  Prove 2 n  n 2 for n  4
Step 1: Prove the result is true for n = 5
Mathematical Induction
e.g .v  Prove 2 n  n 2 for n  4
Step 1: Prove the result is true for n = 5
        LHS  25
             32
Mathematical Induction
e.g .v  Prove 2 n  n 2 for n  4
Step 1: Prove the result is true for n = 5
        LHS  25                       RHS  52
             32                            25
Mathematical Induction
e.g .v  Prove 2 n  n 2 for n  4
Step 1: Prove the result is true for n = 5
        LHS  25                       RHS  52
             32                            25
                         LHS  RHS
Mathematical Induction
e.g .v  Prove 2 n  n 2 for n  4
Step 1: Prove the result is true for n = 5
        LHS  25                        RHS  52
             32                             25
                       LHS  RHS
                  Hence the result is true for n = 5
Mathematical Induction
e.g .v  Prove 2 n  n 2 for n  4
Step 1: Prove the result is true for n = 5
        LHS  25                        RHS  52
             32                             25
                       LHS  RHS
                  Hence the result is true for n = 5

Step 2: Assume the result is true for n = k, where k is a positive
        integer > 4
        i.e. 2 k  k 2
Mathematical Induction
e.g .v  Prove 2 n  n 2 for n  4
Step 1: Prove the result is true for n = 5
        LHS  25                          RHS  52
             32                               25
                       LHS  RHS
                  Hence the result is true for n = 5

Step 2: Assume the result is true for n = k, where k is a positive
        integer > 4
        i.e. 2 k  k 2
Step 3: Prove the result is true for n = k + 1
        i.e. Prove : 2 k 1  k  1
                                      2
Proof:
Proof:
         2 k 1
Proof:
         2 k 1  2  2 k
Proof:
         2 k 1  2  2 k
                 2k 2
Proof:
         2 k 1  2  2 k
                 2k 2
                 k2  k2
Proof:
         2 k 1  2  2 k
                 2k 2
                 k2  k2
                 k2  k k
Proof:
         2 k 1  2  2 k
                 2k 2
                 k2  k2
                 k2  k k
                 k 2  4k
Proof:
         2 k 1  2  2 k
                 2k 2
                 k2  k2
                 k2  k k
                 k 2  4k     k  4
Proof:
         2 k 1  2  2 k
                 2k 2
                 k2  k2
                 k2  k k
                 k 2  4k         k  4
                 k 2  2k  2k
Proof:
         2 k 1  2  2 k
                 2k 2
                 k2  k2
                 k2  k k
                 k 2  4k         k  4
                 k 2  2k  2k
                  k 2  2k  8
Proof:
         2 k 1  2  2 k
                 2k 2
                 k2  k2
                 k2  k k
                 k 2  4k         k  4
                 k 2  2k  2k
                  k 2  2k  8    k  4
Proof:
         2 k 1  2  2 k
                 2k 2
                 k2  k2
                 k2  k k
                 k 2  4k         k  4
                 k 2  2k  2k
                  k 2  2k  8    k  4
                  k 2  2k  1
Proof:
         2 k 1  2  2 k
                 2k 2
                 k2  k2
                 k2  k k
                 k 2  4k         k  4
                 k 2  2k  2k
                  k 2  2k  8    k  4
                  k 2  2k  1
                  k  1
                          2
Proof:
         2 k 1  2  2 k
                 2k 2
                 k2  k2
                 k2  k k
                 k 2  4k              k  4
                 k 2  2k  2k
                  k 2  2k  8         k  4
                  k 2  2k  1
                  k  1
                           2


                  2 k 1  k  1
                                   2
Proof:
      2 k 1  2  2 k
              2k 2
              k2  k2
              k2  k k
              k 2  4k            k  4
              k 2  2k  2k
               k 2  2k  8       k  4
               k 2  2k  1
               k  1
                        2


               2 k 1  k  1
                                2


  Hence the result is true for n = k + 1 if it is also true for n = k
Proof:
       2 k 1  2  2 k
               2k 2
               k2  k2
               k2  k k
               k 2  4k            k  4
               k 2  2k  2k
                k 2  2k  8       k  4
                k 2  2k  1
                k  1
                         2


                2 k 1  k  1
                                 2


   Hence the result is true for n = k + 1 if it is also true for n = k

Step 4: Since the result is true for n = 5, then the result is true for
        all positive integral values of n > 4 by induction .
Proof:
       2 k 1  2  2 k
               2k 2
               k2  k2
               k2  k k
               k 2  4k            k  4             Exercise 6N;
               k 2  2k  2k                            6 abc, 8a, 15
                k 2  2k  8       k  4
                k 2  2k  1
                k  1
                         2


                2 k 1  k  1
                                 2


   Hence the result is true for n = k + 1 if it is also true for n = k

Step 4: Since the result is true for n = 5, then the result is true for
        all positive integral values of n > 4 by induction .

More Related Content

Similar to 11X1 T10 10 mathematical induction 3

11 x1 t14 10 mathematical induction 3 (2012)
11 x1 t14 10 mathematical induction 3 (2012)11 x1 t14 10 mathematical induction 3 (2012)
11 x1 t14 10 mathematical induction 3 (2012)Nigel Simmons
 
11X1 T14 10 mathematical induction 3 (2011)
11X1 T14 10 mathematical induction 3 (2011)11X1 T14 10 mathematical induction 3 (2011)
11X1 T14 10 mathematical induction 3 (2011)Nigel Simmons
 
11 x1 t14 10 mathematical induction 3 (2013)
11 x1 t14 10 mathematical induction 3 (2013)11 x1 t14 10 mathematical induction 3 (2013)
11 x1 t14 10 mathematical induction 3 (2013)Nigel Simmons
 
11X1 T10 09 mathematical induction 2
11X1 T10 09 mathematical induction 211X1 T10 09 mathematical induction 2
11X1 T10 09 mathematical induction 2Nigel Simmons
 
X2 T08 02 induction (2011)
X2 T08 02 induction (2011)X2 T08 02 induction (2011)
X2 T08 02 induction (2011)Nigel Simmons
 
X2 t08 02 induction (2012)
X2 t08 02 induction (2012)X2 t08 02 induction (2012)
X2 t08 02 induction (2012)Nigel Simmons
 
11 x1 t14 09 mathematical induction 2 (2013)
11 x1 t14 09 mathematical induction 2 (2013)11 x1 t14 09 mathematical induction 2 (2013)
11 x1 t14 09 mathematical induction 2 (2013)Nigel Simmons
 
mathematical induction
mathematical inductionmathematical induction
mathematical inductionankush_kumar
 
11X1 T14 09 mathematical induction 2 (2011)
11X1 T14 09 mathematical induction 2 (2011)11X1 T14 09 mathematical induction 2 (2011)
11X1 T14 09 mathematical induction 2 (2011)Nigel Simmons
 
mathematical induction
mathematical inductionmathematical induction
mathematical inductionankush_kumar
 
11 x1 t14 09 mathematical induction 2 (2012)
11 x1 t14 09 mathematical induction 2 (2012)11 x1 t14 09 mathematical induction 2 (2012)
11 x1 t14 09 mathematical induction 2 (2012)Nigel Simmons
 
11X1 T14 09 mathematical induction 2 (2010)
11X1 T14 09 mathematical induction 2 (2010)11X1 T14 09 mathematical induction 2 (2010)
11X1 T14 09 mathematical induction 2 (2010)Nigel Simmons
 
11 x1 t14 08 mathematical induction 1 (2013)
11 x1 t14 08 mathematical induction 1 (2013)11 x1 t14 08 mathematical induction 1 (2013)
11 x1 t14 08 mathematical induction 1 (2013)Nigel Simmons
 
12 x1 t08 03 binomial theorem (2013)
12 x1 t08 03 binomial theorem (2013)12 x1 t08 03 binomial theorem (2013)
12 x1 t08 03 binomial theorem (2013)Nigel Simmons
 
X2 t08 02 induction (2013)
X2 t08 02 induction (2013)X2 t08 02 induction (2013)
X2 t08 02 induction (2013)Nigel Simmons
 
X2 t08 03 inequalities & graphs (2013)
X2 t08 03 inequalities & graphs (2013)X2 t08 03 inequalities & graphs (2013)
X2 t08 03 inequalities & graphs (2013)Nigel Simmons
 
11 x1 t14 11 some different types (2013)
11 x1 t14 11 some different types (2013)11 x1 t14 11 some different types (2013)
11 x1 t14 11 some different types (2013)Nigel Simmons
 

Similar to 11X1 T10 10 mathematical induction 3 (19)

11 x1 t14 10 mathematical induction 3 (2012)
11 x1 t14 10 mathematical induction 3 (2012)11 x1 t14 10 mathematical induction 3 (2012)
11 x1 t14 10 mathematical induction 3 (2012)
 
11X1 T14 10 mathematical induction 3 (2011)
11X1 T14 10 mathematical induction 3 (2011)11X1 T14 10 mathematical induction 3 (2011)
11X1 T14 10 mathematical induction 3 (2011)
 
11 x1 t14 10 mathematical induction 3 (2013)
11 x1 t14 10 mathematical induction 3 (2013)11 x1 t14 10 mathematical induction 3 (2013)
11 x1 t14 10 mathematical induction 3 (2013)
 
11X1 T10 09 mathematical induction 2
11X1 T10 09 mathematical induction 211X1 T10 09 mathematical induction 2
11X1 T10 09 mathematical induction 2
 
X2 T08 02 induction (2011)
X2 T08 02 induction (2011)X2 T08 02 induction (2011)
X2 T08 02 induction (2011)
 
X2 harder induction
X2 harder inductionX2 harder induction
X2 harder induction
 
X2 t08 02 induction (2012)
X2 t08 02 induction (2012)X2 t08 02 induction (2012)
X2 t08 02 induction (2012)
 
11 x1 t14 09 mathematical induction 2 (2013)
11 x1 t14 09 mathematical induction 2 (2013)11 x1 t14 09 mathematical induction 2 (2013)
11 x1 t14 09 mathematical induction 2 (2013)
 
mathematical induction
mathematical inductionmathematical induction
mathematical induction
 
11X1 T14 09 mathematical induction 2 (2011)
11X1 T14 09 mathematical induction 2 (2011)11X1 T14 09 mathematical induction 2 (2011)
11X1 T14 09 mathematical induction 2 (2011)
 
mathematical induction
mathematical inductionmathematical induction
mathematical induction
 
11 x1 t14 09 mathematical induction 2 (2012)
11 x1 t14 09 mathematical induction 2 (2012)11 x1 t14 09 mathematical induction 2 (2012)
11 x1 t14 09 mathematical induction 2 (2012)
 
11X1 T14 09 mathematical induction 2 (2010)
11X1 T14 09 mathematical induction 2 (2010)11X1 T14 09 mathematical induction 2 (2010)
11X1 T14 09 mathematical induction 2 (2010)
 
11 x1 t14 08 mathematical induction 1 (2013)
11 x1 t14 08 mathematical induction 1 (2013)11 x1 t14 08 mathematical induction 1 (2013)
11 x1 t14 08 mathematical induction 1 (2013)
 
12 x1 t08 03 binomial theorem (2013)
12 x1 t08 03 binomial theorem (2013)12 x1 t08 03 binomial theorem (2013)
12 x1 t08 03 binomial theorem (2013)
 
X2 t08 02 induction (2013)
X2 t08 02 induction (2013)X2 t08 02 induction (2013)
X2 t08 02 induction (2013)
 
X2 t08 03 inequalities & graphs (2013)
X2 t08 03 inequalities & graphs (2013)X2 t08 03 inequalities & graphs (2013)
X2 t08 03 inequalities & graphs (2013)
 
11 x1 t14 11 some different types (2013)
11 x1 t14 11 some different types (2013)11 x1 t14 11 some different types (2013)
11 x1 t14 11 some different types (2013)
 
2.4 edited1
2.4 edited12.4 edited1
2.4 edited1
 

More from Nigel Simmons

Goodbye slideshare UPDATE
Goodbye slideshare UPDATEGoodbye slideshare UPDATE
Goodbye slideshare UPDATENigel Simmons
 
12 x1 t02 02 integrating exponentials (2014)
12 x1 t02 02 integrating exponentials (2014)12 x1 t02 02 integrating exponentials (2014)
12 x1 t02 02 integrating exponentials (2014)Nigel Simmons
 
11 x1 t01 03 factorising (2014)
11 x1 t01 03 factorising (2014)11 x1 t01 03 factorising (2014)
11 x1 t01 03 factorising (2014)Nigel Simmons
 
11 x1 t01 02 binomial products (2014)
11 x1 t01 02 binomial products (2014)11 x1 t01 02 binomial products (2014)
11 x1 t01 02 binomial products (2014)Nigel Simmons
 
12 x1 t02 01 differentiating exponentials (2014)
12 x1 t02 01 differentiating exponentials (2014)12 x1 t02 01 differentiating exponentials (2014)
12 x1 t02 01 differentiating exponentials (2014)Nigel Simmons
 
11 x1 t01 01 algebra & indices (2014)
11 x1 t01 01 algebra & indices (2014)11 x1 t01 01 algebra & indices (2014)
11 x1 t01 01 algebra & indices (2014)Nigel Simmons
 
12 x1 t01 03 integrating derivative on function (2013)
12 x1 t01 03 integrating derivative on function (2013)12 x1 t01 03 integrating derivative on function (2013)
12 x1 t01 03 integrating derivative on function (2013)Nigel Simmons
 
12 x1 t01 02 differentiating logs (2013)
12 x1 t01 02 differentiating logs (2013)12 x1 t01 02 differentiating logs (2013)
12 x1 t01 02 differentiating logs (2013)Nigel Simmons
 
12 x1 t01 01 log laws (2013)
12 x1 t01 01 log laws (2013)12 x1 t01 01 log laws (2013)
12 x1 t01 01 log laws (2013)Nigel Simmons
 
X2 t02 04 forming polynomials (2013)
X2 t02 04 forming polynomials (2013)X2 t02 04 forming polynomials (2013)
X2 t02 04 forming polynomials (2013)Nigel Simmons
 
X2 t02 03 roots & coefficients (2013)
X2 t02 03 roots & coefficients (2013)X2 t02 03 roots & coefficients (2013)
X2 t02 03 roots & coefficients (2013)Nigel Simmons
 
X2 t02 02 multiple roots (2013)
X2 t02 02 multiple roots (2013)X2 t02 02 multiple roots (2013)
X2 t02 02 multiple roots (2013)Nigel Simmons
 
X2 t02 01 factorising complex expressions (2013)
X2 t02 01 factorising complex expressions (2013)X2 t02 01 factorising complex expressions (2013)
X2 t02 01 factorising complex expressions (2013)Nigel Simmons
 
11 x1 t16 07 approximations (2013)
11 x1 t16 07 approximations (2013)11 x1 t16 07 approximations (2013)
11 x1 t16 07 approximations (2013)Nigel Simmons
 
11 x1 t16 06 derivative times function (2013)
11 x1 t16 06 derivative times function (2013)11 x1 t16 06 derivative times function (2013)
11 x1 t16 06 derivative times function (2013)Nigel Simmons
 
11 x1 t16 05 volumes (2013)
11 x1 t16 05 volumes (2013)11 x1 t16 05 volumes (2013)
11 x1 t16 05 volumes (2013)Nigel Simmons
 
11 x1 t16 04 areas (2013)
11 x1 t16 04 areas (2013)11 x1 t16 04 areas (2013)
11 x1 t16 04 areas (2013)Nigel Simmons
 
11 x1 t16 03 indefinite integral (2013)
11 x1 t16 03 indefinite integral (2013)11 x1 t16 03 indefinite integral (2013)
11 x1 t16 03 indefinite integral (2013)Nigel Simmons
 
11 x1 t16 02 definite integral (2013)
11 x1 t16 02 definite integral (2013)11 x1 t16 02 definite integral (2013)
11 x1 t16 02 definite integral (2013)Nigel Simmons
 

More from Nigel Simmons (20)

Goodbye slideshare UPDATE
Goodbye slideshare UPDATEGoodbye slideshare UPDATE
Goodbye slideshare UPDATE
 
Goodbye slideshare
Goodbye slideshareGoodbye slideshare
Goodbye slideshare
 
12 x1 t02 02 integrating exponentials (2014)
12 x1 t02 02 integrating exponentials (2014)12 x1 t02 02 integrating exponentials (2014)
12 x1 t02 02 integrating exponentials (2014)
 
11 x1 t01 03 factorising (2014)
11 x1 t01 03 factorising (2014)11 x1 t01 03 factorising (2014)
11 x1 t01 03 factorising (2014)
 
11 x1 t01 02 binomial products (2014)
11 x1 t01 02 binomial products (2014)11 x1 t01 02 binomial products (2014)
11 x1 t01 02 binomial products (2014)
 
12 x1 t02 01 differentiating exponentials (2014)
12 x1 t02 01 differentiating exponentials (2014)12 x1 t02 01 differentiating exponentials (2014)
12 x1 t02 01 differentiating exponentials (2014)
 
11 x1 t01 01 algebra & indices (2014)
11 x1 t01 01 algebra & indices (2014)11 x1 t01 01 algebra & indices (2014)
11 x1 t01 01 algebra & indices (2014)
 
12 x1 t01 03 integrating derivative on function (2013)
12 x1 t01 03 integrating derivative on function (2013)12 x1 t01 03 integrating derivative on function (2013)
12 x1 t01 03 integrating derivative on function (2013)
 
12 x1 t01 02 differentiating logs (2013)
12 x1 t01 02 differentiating logs (2013)12 x1 t01 02 differentiating logs (2013)
12 x1 t01 02 differentiating logs (2013)
 
12 x1 t01 01 log laws (2013)
12 x1 t01 01 log laws (2013)12 x1 t01 01 log laws (2013)
12 x1 t01 01 log laws (2013)
 
X2 t02 04 forming polynomials (2013)
X2 t02 04 forming polynomials (2013)X2 t02 04 forming polynomials (2013)
X2 t02 04 forming polynomials (2013)
 
X2 t02 03 roots & coefficients (2013)
X2 t02 03 roots & coefficients (2013)X2 t02 03 roots & coefficients (2013)
X2 t02 03 roots & coefficients (2013)
 
X2 t02 02 multiple roots (2013)
X2 t02 02 multiple roots (2013)X2 t02 02 multiple roots (2013)
X2 t02 02 multiple roots (2013)
 
X2 t02 01 factorising complex expressions (2013)
X2 t02 01 factorising complex expressions (2013)X2 t02 01 factorising complex expressions (2013)
X2 t02 01 factorising complex expressions (2013)
 
11 x1 t16 07 approximations (2013)
11 x1 t16 07 approximations (2013)11 x1 t16 07 approximations (2013)
11 x1 t16 07 approximations (2013)
 
11 x1 t16 06 derivative times function (2013)
11 x1 t16 06 derivative times function (2013)11 x1 t16 06 derivative times function (2013)
11 x1 t16 06 derivative times function (2013)
 
11 x1 t16 05 volumes (2013)
11 x1 t16 05 volumes (2013)11 x1 t16 05 volumes (2013)
11 x1 t16 05 volumes (2013)
 
11 x1 t16 04 areas (2013)
11 x1 t16 04 areas (2013)11 x1 t16 04 areas (2013)
11 x1 t16 04 areas (2013)
 
11 x1 t16 03 indefinite integral (2013)
11 x1 t16 03 indefinite integral (2013)11 x1 t16 03 indefinite integral (2013)
11 x1 t16 03 indefinite integral (2013)
 
11 x1 t16 02 definite integral (2013)
11 x1 t16 02 definite integral (2013)11 x1 t16 02 definite integral (2013)
11 x1 t16 02 definite integral (2013)
 

Recently uploaded

Concept of Vouching. B.Com(Hons) /B.Compdf
Concept of Vouching. B.Com(Hons) /B.CompdfConcept of Vouching. B.Com(Hons) /B.Compdf
Concept of Vouching. B.Com(Hons) /B.CompdfUmakantAnnand
 
Grant Readiness 101 TechSoup and Remy Consulting
Grant Readiness 101 TechSoup and Remy ConsultingGrant Readiness 101 TechSoup and Remy Consulting
Grant Readiness 101 TechSoup and Remy ConsultingTechSoup
 
microwave assisted reaction. General introduction
microwave assisted reaction. General introductionmicrowave assisted reaction. General introduction
microwave assisted reaction. General introductionMaksud Ahmed
 
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...EduSkills OECD
 
The basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptxThe basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptxheathfieldcps1
 
Presiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha electionsPresiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha electionsanshu789521
 
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdf
BASLIQ CURRENT LOOKBOOK  LOOKBOOK(1) (1).pdfBASLIQ CURRENT LOOKBOOK  LOOKBOOK(1) (1).pdf
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdfSoniaTolstoy
 
Solving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptxSolving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptxOH TEIK BIN
 
Call Girls in Dwarka Mor Delhi Contact Us 9654467111
Call Girls in Dwarka Mor Delhi Contact Us 9654467111Call Girls in Dwarka Mor Delhi Contact Us 9654467111
Call Girls in Dwarka Mor Delhi Contact Us 9654467111Sapana Sha
 
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions  for the students and aspirants of Chemistry12th.pptxOrganic Name Reactions  for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions for the students and aspirants of Chemistry12th.pptxVS Mahajan Coaching Centre
 
Paris 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activityParis 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activityGeoBlogs
 
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptxPOINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptxSayali Powar
 
Mastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory InspectionMastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory InspectionSafetyChain Software
 
MENTAL STATUS EXAMINATION format.docx
MENTAL     STATUS EXAMINATION format.docxMENTAL     STATUS EXAMINATION format.docx
MENTAL STATUS EXAMINATION format.docxPoojaSen20
 
Hybridoma Technology ( Production , Purification , and Application )
Hybridoma Technology  ( Production , Purification , and Application  ) Hybridoma Technology  ( Production , Purification , and Application  )
Hybridoma Technology ( Production , Purification , and Application ) Sakshi Ghasle
 
Crayon Activity Handout For the Crayon A
Crayon Activity Handout For the Crayon ACrayon Activity Handout For the Crayon A
Crayon Activity Handout For the Crayon AUnboundStockton
 
Accessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impactAccessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impactdawncurless
 
Alper Gobel In Media Res Media Component
Alper Gobel In Media Res Media ComponentAlper Gobel In Media Res Media Component
Alper Gobel In Media Res Media ComponentInMediaRes1
 

Recently uploaded (20)

Concept of Vouching. B.Com(Hons) /B.Compdf
Concept of Vouching. B.Com(Hons) /B.CompdfConcept of Vouching. B.Com(Hons) /B.Compdf
Concept of Vouching. B.Com(Hons) /B.Compdf
 
Grant Readiness 101 TechSoup and Remy Consulting
Grant Readiness 101 TechSoup and Remy ConsultingGrant Readiness 101 TechSoup and Remy Consulting
Grant Readiness 101 TechSoup and Remy Consulting
 
microwave assisted reaction. General introduction
microwave assisted reaction. General introductionmicrowave assisted reaction. General introduction
microwave assisted reaction. General introduction
 
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...
 
The basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptxThe basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptx
 
Presiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha electionsPresiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha elections
 
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdf
BASLIQ CURRENT LOOKBOOK  LOOKBOOK(1) (1).pdfBASLIQ CURRENT LOOKBOOK  LOOKBOOK(1) (1).pdf
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdf
 
Solving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptxSolving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptx
 
Código Creativo y Arte de Software | Unidad 1
Código Creativo y Arte de Software | Unidad 1Código Creativo y Arte de Software | Unidad 1
Código Creativo y Arte de Software | Unidad 1
 
TataKelola dan KamSiber Kecerdasan Buatan v022.pdf
TataKelola dan KamSiber Kecerdasan Buatan v022.pdfTataKelola dan KamSiber Kecerdasan Buatan v022.pdf
TataKelola dan KamSiber Kecerdasan Buatan v022.pdf
 
Call Girls in Dwarka Mor Delhi Contact Us 9654467111
Call Girls in Dwarka Mor Delhi Contact Us 9654467111Call Girls in Dwarka Mor Delhi Contact Us 9654467111
Call Girls in Dwarka Mor Delhi Contact Us 9654467111
 
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions  for the students and aspirants of Chemistry12th.pptxOrganic Name Reactions  for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
 
Paris 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activityParis 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activity
 
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptxPOINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
 
Mastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory InspectionMastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory Inspection
 
MENTAL STATUS EXAMINATION format.docx
MENTAL     STATUS EXAMINATION format.docxMENTAL     STATUS EXAMINATION format.docx
MENTAL STATUS EXAMINATION format.docx
 
Hybridoma Technology ( Production , Purification , and Application )
Hybridoma Technology  ( Production , Purification , and Application  ) Hybridoma Technology  ( Production , Purification , and Application  )
Hybridoma Technology ( Production , Purification , and Application )
 
Crayon Activity Handout For the Crayon A
Crayon Activity Handout For the Crayon ACrayon Activity Handout For the Crayon A
Crayon Activity Handout For the Crayon A
 
Accessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impactAccessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impact
 
Alper Gobel In Media Res Media Component
Alper Gobel In Media Res Media ComponentAlper Gobel In Media Res Media Component
Alper Gobel In Media Res Media Component
 

11X1 T10 10 mathematical induction 3

  • 2. Mathematical Induction e.g .v  Prove 2 n  n 2 for n  4
  • 3. Mathematical Induction e.g .v  Prove 2 n  n 2 for n  4 Step 1: Prove the result is true for n = 5
  • 4. Mathematical Induction e.g .v  Prove 2 n  n 2 for n  4 Step 1: Prove the result is true for n = 5 LHS  25  32
  • 5. Mathematical Induction e.g .v  Prove 2 n  n 2 for n  4 Step 1: Prove the result is true for n = 5 LHS  25 RHS  52  32  25
  • 6. Mathematical Induction e.g .v  Prove 2 n  n 2 for n  4 Step 1: Prove the result is true for n = 5 LHS  25 RHS  52  32  25  LHS  RHS
  • 7. Mathematical Induction e.g .v  Prove 2 n  n 2 for n  4 Step 1: Prove the result is true for n = 5 LHS  25 RHS  52  32  25  LHS  RHS Hence the result is true for n = 5
  • 8. Mathematical Induction e.g .v  Prove 2 n  n 2 for n  4 Step 1: Prove the result is true for n = 5 LHS  25 RHS  52  32  25  LHS  RHS Hence the result is true for n = 5 Step 2: Assume the result is true for n = k, where k is a positive integer > 4 i.e. 2 k  k 2
  • 9. Mathematical Induction e.g .v  Prove 2 n  n 2 for n  4 Step 1: Prove the result is true for n = 5 LHS  25 RHS  52  32  25  LHS  RHS Hence the result is true for n = 5 Step 2: Assume the result is true for n = k, where k is a positive integer > 4 i.e. 2 k  k 2 Step 3: Prove the result is true for n = k + 1 i.e. Prove : 2 k 1  k  1 2
  • 11. Proof: 2 k 1
  • 12. Proof: 2 k 1  2  2 k
  • 13. Proof: 2 k 1  2  2 k  2k 2
  • 14. Proof: 2 k 1  2  2 k  2k 2  k2  k2
  • 15. Proof: 2 k 1  2  2 k  2k 2  k2  k2  k2  k k
  • 16. Proof: 2 k 1  2  2 k  2k 2  k2  k2  k2  k k  k 2  4k
  • 17. Proof: 2 k 1  2  2 k  2k 2  k2  k2  k2  k k  k 2  4k  k  4
  • 18. Proof: 2 k 1  2  2 k  2k 2  k2  k2  k2  k k  k 2  4k  k  4  k 2  2k  2k
  • 19. Proof: 2 k 1  2  2 k  2k 2  k2  k2  k2  k k  k 2  4k  k  4  k 2  2k  2k  k 2  2k  8
  • 20. Proof: 2 k 1  2  2 k  2k 2  k2  k2  k2  k k  k 2  4k  k  4  k 2  2k  2k  k 2  2k  8  k  4
  • 21. Proof: 2 k 1  2  2 k  2k 2  k2  k2  k2  k k  k 2  4k  k  4  k 2  2k  2k  k 2  2k  8  k  4  k 2  2k  1
  • 22. Proof: 2 k 1  2  2 k  2k 2  k2  k2  k2  k k  k 2  4k  k  4  k 2  2k  2k  k 2  2k  8  k  4  k 2  2k  1  k  1 2
  • 23. Proof: 2 k 1  2  2 k  2k 2  k2  k2  k2  k k  k 2  4k  k  4  k 2  2k  2k  k 2  2k  8  k  4  k 2  2k  1  k  1 2  2 k 1  k  1 2
  • 24. Proof: 2 k 1  2  2 k  2k 2  k2  k2  k2  k k  k 2  4k  k  4  k 2  2k  2k  k 2  2k  8  k  4  k 2  2k  1  k  1 2  2 k 1  k  1 2 Hence the result is true for n = k + 1 if it is also true for n = k
  • 25. Proof: 2 k 1  2  2 k  2k 2  k2  k2  k2  k k  k 2  4k  k  4  k 2  2k  2k  k 2  2k  8  k  4  k 2  2k  1  k  1 2  2 k 1  k  1 2 Hence the result is true for n = k + 1 if it is also true for n = k Step 4: Since the result is true for n = 5, then the result is true for all positive integral values of n > 4 by induction .
  • 26. Proof: 2 k 1  2  2 k  2k 2  k2  k2  k2  k k  k 2  4k  k  4 Exercise 6N;  k 2  2k  2k 6 abc, 8a, 15  k 2  2k  8  k  4  k 2  2k  1  k  1 2  2 k 1  k  1 2 Hence the result is true for n = k + 1 if it is also true for n = k Step 4: Since the result is true for n = 5, then the result is true for all positive integral values of n > 4 by induction .