SlideShare a Scribd company logo
1 of 53
Download to read offline
Mathematical Induction
Mathematical Induction
                    1 1         1       1
e.g. i  Prove 1  2  2    2  2 
                   2 3         n        n
Mathematical Induction
                    1 1         1       1
e.g. i  Prove 1  2  2    2  2 
                   2 3         n        n
Test: n = 1
Mathematical Induction
                    1 1         1       1
e.g. i  Prove 1  2  2    2  2 
                   2 3         n        n
                           1
Test: n = 1       L.H .S  2
                          1
                         1
Mathematical Induction
                    1 1         1       1
e.g. i  Prove 1  2  2    2  2 
                   2 3         n        n
                           1                             1
Test: n = 1       L.H .S  2                R.H .S  2 
                          1                              1
                         1                        1
Mathematical Induction
                    1 1         1       1
e.g. i  Prove 1  2  2    2  2 
                   2 3         n        n
                           1                                  1
Test: n = 1       L.H .S  2                     R.H .S  2 
                          1                                   1
                         1                             1
                                L.H .S  R.H .S
Mathematical Induction
                    1 1         1       1
e.g. i  Prove 1  2  2    2  2 
                   2 3         n        n
                           1                                  1
Test: n = 1       L.H .S  2                     R.H .S  2 
                          1                                   1
                         1                             1
                                L.H .S  R.H .S

               1 1         1       1
A n  k  1  2  2    2  2 
              2 3         k        k
Mathematical Induction
                    1 1         1       1
e.g. i  Prove 1  2  2    2  2 
                   2 3         n        n
                           1                                  1
Test: n = 1       L.H .S  2                     R.H .S  2 
                          1                                   1
                         1                             1
                                L.H .S  R.H .S

               1 1         1       1
A n  k  1  2  2    2  2 
              2 3         k        k
                  1 1            1            1
P n  k  1 1  2  2              2
                 2 3          k  12
                                            k 1
Proof:
   1 1          1          1 1       1   1
1 2  2            1 2  2  2 
  2 3        k  12
                          2 3       k k  12
Proof:
   1 1          1          1 1        1    1
1 2  2            1 2  2  2 
  2 3        k  12
                          2 3         k k  12
                           1    1
                       2 
                           k k  12
Proof:
   1 1          1          1 1         1    1
1 2  2            1 2  2  2 
  2 3        k  12
                           2 3         k k  12
                           1       1
                       2 
                           k k  12
                           k  1  k
                                  2
                       2
                            k k  1
                                     2
Proof:
   1 1          1          1 1          1    1
1 2  2            1 2  2  2 
  2 3        k  12
                           2 3          k k  12
                           1        1
                       2 
                           k k  12
                           k  1  k
                                   2
                       2
                            k k  1
                                      2

                            k 2  k 1
                       2
                            k k  1
                                      2
Proof:
   1 1          1          1 1            1      1
1 2  2            1 2  2  2 
  2 3        k  12
                           2 3            k k  12
                           1        1
                       2 
                           k k  12
                           k  1  k
                                   2
                       2
                            k k  1
                                      2

                            k 2  k 1
                       2
                            k k  1
                                      2


                             k2  k        1
                       2              
                            k k  1 k k  1
                                     2         2
Proof:
   1 1          1          1 1            1      1
1 2  2            1 2  2  2 
  2 3        k  12
                           2 3            k k  12
                           1        1
                       2 
                           k k  12
                           k  1  k
                                   2
                       2
                             k k  1
                                      2

                            k 2  k 1
                       2
                            k k  1
                                      2


                              k2  k       1
                       2              
                            k k  1 k k  1
                                     2         2

                            k k  1
                       2
                            k k  1
                                     2
Proof:
   1 1          1           1 1            1      1
1 2  2            1 2  2  2 
  2 3        k  12
                           2 3             k k  12
                            1        1
                       2 
                            k k  12
                            k  1  k
                                    2
                       2
                              k k  1
                                       2

                             k 2  k 1
                       2
                             k k  1
                                       2


                               k2  k       1
                       2               
                             k k  1 k k  1
                                      2         2

                             k k  1
                       2
                             k k  1
                                      2

                                  1
                          2
                                k 1
Proof:
   1 1           1           1 1            1      1
1 2  2             1 2  2  2 
  2 3         k  12
                            2 3             k k  12
                             1        1
                        2 
                             k k  12
                             k  1  k
                                     2
                        2
                               k k  1
                                        2

                              k 2  k 1
                         2
                              k k  1
                                        2


                                k2  k       1
                        2               
                              k k  1 k k  1
                                       2         2

                              k k  1
                        2
                              k k  1
                                       2

                                   1
                           2
                                 k 1
     1 1            1              1
1  2  2              2
     2 3         k  12
                                 k 1
(ii) A sequence is defined by;
                a1  2         an1  2  an for n  1
   Show that an  2 for n  1
(ii) A sequence is defined by;
                a1  2         an1  2  an for n  1
   Show that an  2 for n  1
Test: n = 1
(ii) A sequence is defined by;
                a1  2         an1  2  an for n  1
   Show that an  2 for n  1
Test: n = 1   a1  2  2
(ii) A sequence is defined by;
                a1  2         an1  2  an for n  1
   Show that an  2 for n  1
Test: n = 1   a1  2  2
A n  k  ak  2
(ii) A sequence is defined by;
                a1  2         an1  2  an for n  1
    Show that an  2 for n  1
Test: n = 1    a1  2  2
A n  k  ak  2

P   n  k  1 ak 1  2
(ii) A sequence is defined by;
                a1  2         an1  2  an for n  1
    Show that an  2 for n  1
Test: n = 1    a1  2  2
A n  k  ak  2

P   n  k  1 ak 1  2
Proof:
(ii) A sequence is defined by;
                a1  2         an1  2  an for n  1
    Show that an  2 for n  1
Test: n = 1    a1  2  2
A n  k  ak  2

P   n  k  1 ak 1  2
Proof:
      ak 1  2  ak
(ii) A sequence is defined by;
                a1  2         an1  2  an for n  1
    Show that an  2 for n  1
Test: n = 1    a1  2  2
A n  k  ak  2

P   n  k  1 ak 1  2
Proof:
      ak 1  2  ak
           22
(ii) A sequence is defined by;
                a1  2         an1  2  an for n  1
    Show that an  2 for n  1
Test: n = 1    a1  2  2
A n  k  ak  2

P   n  k  1 ak 1  2
Proof:
      ak 1  2  ak
           22
           4
          2
(ii) A sequence is defined by;
                a1  2         an1  2  an for n  1
    Show that an  2 for n  1
Test: n = 1    a1  2  2
A n  k  ak  2

P   n  k  1 ak 1  2
Proof:
      ak 1  2  ak
           22
             4
            2
     ak 1  2
iii The sequences xn and yn are defined by;
                                           xn  yn         2x y
           x1  5, y1  2         xn1            , yn1  n n
                                              2            xn  yn
     Prove xn yn  10 for n  1
iii The sequences xn and yn are defined by;
                                           xn  yn         2x y
              x1  5, y1  2      xn1            , yn1  n n
                                              2            xn  yn
     Prove xn yn  10 for n  1
Test: n = 1
iii The sequences xn and yn are defined by;
                                            xn  yn         2x y
            x1  5, y1  2         xn1            , yn1  n n
                                               2            xn  yn
      Prove xn yn  10 for n  1
Test: n = 1 x1 y1  52
                     10
iii The sequences xn and yn are defined by;
                                            xn  yn         2x y
            x1  5, y1  2         xn1            , yn1  n n
                                               2            xn  yn
      Prove xn yn  10 for n  1
Test: n = 1 x1 y1  52
                    10
A n  k  xk yk  10
iii The sequences xn and yn are defined by;
                                            xn  yn         2x y
             x1  5, y1  2        xn1            , yn1  n n
                                               2            xn  yn
      Prove xn yn  10 for n  1
Test: n = 1 x1 y1  52
                    10
A n  k  xk yk  10

P   n  k  1 xk 1 yk 1  10
iii The sequences xn and yn are defined by;
                                            xn  yn         2x y
             x1  5, y1  2        xn1            , yn1  n n
                                               2            xn  yn
      Prove xn yn  10 for n  1
Test: n = 1 x1 y1  52
                    10
A n  k  xk yk  10

P   n  k  1 xk 1 yk 1  10
Proof:
iii The sequences xn and yn are defined by;
                                                     xn  yn         2x y
               x1  5, y1  2               xn1            , yn1  n n
                                                        2            xn  yn
      Prove xn yn  10 for n  1
Test: n = 1 x1 y1  52
                    10
A n  k  xk yk  10

P     n  k  1 xk 1 yk 1  10
Proof:
                   xk  yk  2 xk yk 
    xk 1 yk 1           
                             x  y    
                   2  k            k 
iii The sequences xn and yn are defined by;
                                                     xn  yn         2x y
               x1  5, y1  2               xn1            , yn1  n n
                                                        2            xn  yn
      Prove xn yn  10 for n  1
Test: n = 1 x1 y1  52
                    10
A n  k  xk yk  10

P     n  k  1 xk 1 yk 1  10
Proof:
                   xk  yk  2 xk yk 
    xk 1 yk 1           
                             x  y    
                   2  k            k 

               xk y k
               10
iii The sequences xn and yn are defined by;
                                                     xn  yn         2x y
               x1  5, y1  2               xn1            , yn1  n n
                                                        2            xn  yn
      Prove xn yn  10 for n  1
Test: n = 1 x1 y1  52
                    10
A n  k  xk yk  10

P     n  k  1 xk 1 yk 1  10
Proof:
                   xk  yk  2 xk yk 
    xk 1 yk 1           
                             x  y    
                   2  k            k 

               xk y k
               10
 xk 1 yk 1  10
(iv) The Fibonacci sequence is defined by;
              a1  a2  1       an1  an  an1 for n  1
                             n
                     1  5 
     Prove that an         for n  1
                      2 
(iv) The Fibonacci sequence is defined by;
              a1  a2  1       an1  an  an1 for n  1
                             n
                     1  5 
     Prove that an         for n  1
                      2 
Test: n = 1 and n =2
(iv) The Fibonacci sequence is defined by;
              a1  a2  1       an1  an  an1 for n  1
                             n
                     1  5 
     Prove that an         for n  1
                      2 
Test: n = 1 and n =2
  L.H .S  a1
        1
(iv) The Fibonacci sequence is defined by;
              a1  a2  1       an1  an  an1 for n  1
                             n
                     1  5 
     Prove that an         for n  1
                      2 
Test: n = 1 and n =2                             1
                                          1  5 
  L.H .S  a1                    R.H .S        
                                           2 
        1
                                         1.62
(iv) The Fibonacci sequence is defined by;
              a1  a2  1       an1  an  an1 for n  1
                             n
                     1  5 
     Prove that an         for n  1
                      2 
Test: n = 1 and n =2                             1
                                       1  5 
  L.H .S  a1                 R.H .S        
                                        2 
        1
                                      1.62
                  L.H .S  R.H .S
(iv) The Fibonacci sequence is defined by;
              a1  a2  1       an1  an  an1 for n  1
                             n
                     1  5 
     Prove that an         for n  1
                      2 
Test: n = 1 and n =2                             1
                                       1  5 
  L.H .S  a1                 R.H .S        
                                        2 
        1
                                      1.62
                  L.H .S  R.H .S
  L.H .S  a2
         1
(iv) The Fibonacci sequence is defined by;
              a1  a2  1       an1  an  an1 for n  1
                             n
                     1  5 
     Prove that an         for n  1
                      2 
Test: n = 1 and n =2                             1
                                       1  5 
  L.H .S  a1                 R.H .S        
                                        2 
        1
                                      1.62
                  L.H .S  R.H .S              2
                                       1  5 
  L.H .S  a2                 R.H .S        
                                        2 
         1
                                      2.62
(iv) The Fibonacci sequence is defined by;
              a1  a2  1       an1  an  an1 for n  1
                             n
                     1  5 
     Prove that an         for n  1
                      2 
Test: n = 1 and n =2                             1
                                       1  5 
  L.H .S  a1                 R.H .S        
                                        2 
        1
                                      1.62
                  L.H .S  R.H .S              2
                                       1  5 
  L.H .S  a2                 R.H .S        
                                        2 
         1
                                      2.62
                  L.H .S  R.H .S
(iv) The Fibonacci sequence is defined by;
              a1  a2  1       an1  an  an1 for n  1
                                n
                     1  5 
     Prove that an         for n  1
                      2 
Test: n = 1 and n =2                                 1
                                            1  5 
  L.H .S  a1                     R.H .S         
                                             2 
         1
                                          1.62
                  L.H .S  R.H .S                    2
                                             1  5 
  L.H .S  a2                      R.H .S         
                                              2 
         1
                                           2.62
                   L.H .S  R.H .S
                                          k 1                  k
                                 1  5               1  5 
  A n  k  1 & n  k  ak 1          & ak             
                                  2                   2 
(iv) The Fibonacci sequence is defined by;
              a1  a2  1       an1  an  an1 for n  1
                                n
                     1  5 
     Prove that an         for n  1
                      2 
Test: n = 1 and n =2                                 1
                                            1  5 
  L.H .S  a1                     R.H .S         
                                             2 
         1
                                          1.62
                  L.H .S  R.H .S                    2
                                             1  5 
  L.H .S  a2                      R.H .S         
                                              2 
         1
                                           2.62
                   L.H .S  R.H .S
                                          k 1                  k
                                 1  5               1  5 
  A n  k  1 & n  k  ak 1          & ak             
                                  2                   2 
                                    k 1
                       1  5 
 P n  k  1 ak 1        
                        2 
Proof:   ak 1  ak  ak 1
Proof:   ak 1  ak  ak 1
                              k    k 1
               1  5  1  5 
                          
                2   2 
Proof:   ak 1  ak  ak 1
                              k     k 1
               1  5  1       5
                              
                2   2           
                        k 1         1         2
                1  5   1    5    1  5  
                                        
                2   2              2      
Proof:   ak 1  ak  ak 1
                              k   k 1
               1  5  1 5
                        
                2   2     
                        k 1   1         2
                1  5   1 
                            5    1  5  
                                  
                2   2    
                                  2      
                       k 1
               1  5   2       4 
                                 2
                2  1  5 1  5  
Proof:   ak 1  ak  ak 1
                              k                k 1
               1  5  1        5
                               
                2   2            
                        k 1          1         2
                1  5   1     5    1  5  
                                         
                2   2               2      
                           k 1
               1      5  2           4 
                                        2
                2         1  5 1  5  
                           k 1
               1      5  2  2 5  4
                                  2 
                2          1  5  
                              k 1
               1  5               62 5 
                                           2
                2                   1  5  
Proof:   ak 1  ak  ak 1
                              k       k 1
               1  5  1        5
                               
                2   2            
                        k 1          1         2
                1  5   1     5    1  5  
                                         
                2   2               2      
                           k 1
               1      5  2           4 
                                        2
                2         1  5 1  5  
                           k 1
               1      5  2  2 5  4
                                  2 
                2          1  5  
                              k 1
               1  5   6  2 5 
                               
                  2   1  5 2 
                        k 1
               1  5 
                    
                2 
Proof:     ak 1  ak  ak 1
                                k       k 1
                 1  5  1        5
                                 
                  2   2            
                          k 1          1         2
                  1  5   1     5    1  5  
                                           
                  2   2               2      
                             k 1
                 1      5  2           4 
                                          2
                  2         1  5 1  5  
                             k 1
                 1      5  2  2 5  4
                                    2 
                  2          1  5  
                                k 1
                   1  5   6  2 5 
                                   
                      2   1  5 2 
                            k 1
                   1  5 
                        
                    2 
                            k 1
                   1  5 
          ak 1        
                    2 
Proof:           ak 1  ak  ak 1
                                      k       k 1
                       1  5  1        5
                                       
                        2   2            
                                k 1          1         2
                        1  5   1     5    1  5  
                                                 
                        2   2               2      
                                   k 1
                       1      5  2           4 
     Sheets                                     2
                        2         1  5 1  5  
                                   k 1
         +             1      5  2  2 5  4
                                          2 
                        2          1  5  
 Exercise 10E*
                                      k 1
                        1  5   6  2 5 
                                        
                           2   1  5 2 
                                 k 1
                        1  5 
                             
                         2 
                                 k 1
                        1  5 
               ak 1        
                         2 

More Related Content

Similar to X2 harder induction

11X1 T10 10 mathematical induction 3
11X1 T10 10 mathematical induction 311X1 T10 10 mathematical induction 3
11X1 T10 10 mathematical induction 3Nigel Simmons
 
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
 
11X1 T14 10 mathematical induction 3 (2010)
11X1 T14 10 mathematical induction 3 (2010)11X1 T14 10 mathematical induction 3 (2010)
11X1 T14 10 mathematical induction 3 (2010)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
 
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
 
X2 t08 02 induction (2013)
X2 t08 02 induction (2013)X2 t08 02 induction (2013)
X2 t08 02 induction (2013)Nigel Simmons
 
mathematical induction and stuff Induction.pptx
mathematical induction and stuff Induction.pptxmathematical induction and stuff Induction.pptx
mathematical induction and stuff Induction.pptxZenLooper
 
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
 

Similar to X2 harder induction (15)

11X1 T10 10 mathematical induction 3
11X1 T10 10 mathematical induction 311X1 T10 10 mathematical induction 3
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)
 
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)
 
11X1 T14 10 mathematical induction 3 (2010)
11X1 T14 10 mathematical induction 3 (2010)11X1 T14 10 mathematical induction 3 (2010)
11X1 T14 10 mathematical induction 3 (2010)
 
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
 
2.4 edited1
2.4 edited12.4 edited1
2.4 edited1
 
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)
 
X2 t08 02 induction (2013)
X2 t08 02 induction (2013)X2 t08 02 induction (2013)
X2 t08 02 induction (2013)
 
mathematical induction and stuff Induction.pptx
mathematical induction and stuff Induction.pptxmathematical induction and stuff Induction.pptx
mathematical induction and stuff Induction.pptx
 
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)
 

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

Science 7 - LAND and SEA BREEZE and its Characteristics
Science 7 - LAND and SEA BREEZE and its CharacteristicsScience 7 - LAND and SEA BREEZE and its Characteristics
Science 7 - LAND and SEA BREEZE and its CharacteristicsKarinaGenton
 
Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)eniolaolutunde
 
CARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptxCARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptxGaneshChakor2
 
Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxEmployee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxNirmalaLoungPoorunde1
 
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
 
Paris 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activityParis 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activityGeoBlogs
 
PSYCHIATRIC History collection FORMAT.pptx
PSYCHIATRIC   History collection FORMAT.pptxPSYCHIATRIC   History collection FORMAT.pptx
PSYCHIATRIC History collection FORMAT.pptxPoojaSen20
 
Introduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptxIntroduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptxpboyjonauth
 
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...Marc Dusseiller Dusjagr
 
mini mental status format.docx
mini    mental       status     format.docxmini    mental       status     format.docx
mini mental status format.docxPoojaSen20
 
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptxSOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptxiammrhaywood
 
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
 
The Most Excellent Way | 1 Corinthians 13
The Most Excellent Way | 1 Corinthians 13The Most Excellent Way | 1 Corinthians 13
The Most Excellent Way | 1 Corinthians 13Steve Thomason
 
How to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptxHow to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptxmanuelaromero2013
 
Separation of Lanthanides/ Lanthanides and Actinides
Separation of Lanthanides/ Lanthanides and ActinidesSeparation of Lanthanides/ Lanthanides and Actinides
Separation of Lanthanides/ Lanthanides and ActinidesFatimaKhan178732
 
MENTAL STATUS EXAMINATION format.docx
MENTAL     STATUS EXAMINATION format.docxMENTAL     STATUS EXAMINATION format.docx
MENTAL STATUS EXAMINATION format.docxPoojaSen20
 

Recently uploaded (20)

Science 7 - LAND and SEA BREEZE and its Characteristics
Science 7 - LAND and SEA BREEZE and its CharacteristicsScience 7 - LAND and SEA BREEZE and its Characteristics
Science 7 - LAND and SEA BREEZE and its Characteristics
 
Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)
 
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
 
CARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptxCARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptx
 
Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxEmployee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptx
 
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
 
Paris 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activityParis 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activity
 
PSYCHIATRIC History collection FORMAT.pptx
PSYCHIATRIC   History collection FORMAT.pptxPSYCHIATRIC   History collection FORMAT.pptx
PSYCHIATRIC History collection FORMAT.pptx
 
Introduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptxIntroduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptx
 
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
 
Model Call Girl in Bikash Puri Delhi reach out to us at 🔝9953056974🔝
Model Call Girl in Bikash Puri  Delhi reach out to us at 🔝9953056974🔝Model Call Girl in Bikash Puri  Delhi reach out to us at 🔝9953056974🔝
Model Call Girl in Bikash Puri Delhi reach out to us at 🔝9953056974🔝
 
mini mental status format.docx
mini    mental       status     format.docxmini    mental       status     format.docx
mini mental status format.docx
 
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptxSOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
 
Staff of Color (SOC) Retention Efforts DDSD
Staff of Color (SOC) Retention Efforts DDSDStaff of Color (SOC) Retention Efforts DDSD
Staff of Color (SOC) Retention Efforts DDSD
 
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
 
The Most Excellent Way | 1 Corinthians 13
The Most Excellent Way | 1 Corinthians 13The Most Excellent Way | 1 Corinthians 13
The Most Excellent Way | 1 Corinthians 13
 
How to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptxHow to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptx
 
Separation of Lanthanides/ Lanthanides and Actinides
Separation of Lanthanides/ Lanthanides and ActinidesSeparation of Lanthanides/ Lanthanides and Actinides
Separation of Lanthanides/ Lanthanides and Actinides
 
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
 
MENTAL STATUS EXAMINATION format.docx
MENTAL     STATUS EXAMINATION format.docxMENTAL     STATUS EXAMINATION format.docx
MENTAL STATUS EXAMINATION format.docx
 

X2 harder induction

  • 2. Mathematical Induction 1 1 1 1 e.g. i  Prove 1  2  2    2  2  2 3 n n
  • 3. Mathematical Induction 1 1 1 1 e.g. i  Prove 1  2  2    2  2  2 3 n n Test: n = 1
  • 4. Mathematical Induction 1 1 1 1 e.g. i  Prove 1  2  2    2  2  2 3 n n 1 Test: n = 1 L.H .S  2 1 1
  • 5. Mathematical Induction 1 1 1 1 e.g. i  Prove 1  2  2    2  2  2 3 n n 1 1 Test: n = 1 L.H .S  2 R.H .S  2  1 1 1 1
  • 6. Mathematical Induction 1 1 1 1 e.g. i  Prove 1  2  2    2  2  2 3 n n 1 1 Test: n = 1 L.H .S  2 R.H .S  2  1 1 1 1  L.H .S  R.H .S
  • 7. Mathematical Induction 1 1 1 1 e.g. i  Prove 1  2  2    2  2  2 3 n n 1 1 Test: n = 1 L.H .S  2 R.H .S  2  1 1 1 1  L.H .S  R.H .S 1 1 1 1 A n  k  1  2  2    2  2  2 3 k k
  • 8. Mathematical Induction 1 1 1 1 e.g. i  Prove 1  2  2    2  2  2 3 n n 1 1 Test: n = 1 L.H .S  2 R.H .S  2  1 1 1 1  L.H .S  R.H .S 1 1 1 1 A n  k  1  2  2    2  2  2 3 k k 1 1 1 1 P n  k  1 1  2  2     2 2 3 k  12 k 1
  • 9. Proof: 1 1 1 1 1 1 1 1 2  2   1 2  2  2  2 3 k  12 2 3 k k  12
  • 10. Proof: 1 1 1 1 1 1 1 1 2  2   1 2  2  2  2 3 k  12 2 3 k k  12 1 1  2  k k  12
  • 11. Proof: 1 1 1 1 1 1 1 1 2  2   1 2  2  2  2 3 k  12 2 3 k k  12 1 1  2  k k  12 k  1  k 2  2 k k  1 2
  • 12. Proof: 1 1 1 1 1 1 1 1 2  2   1 2  2  2  2 3 k  12 2 3 k k  12 1 1  2  k k  12 k  1  k 2  2 k k  1 2 k 2  k 1  2 k k  1 2
  • 13. Proof: 1 1 1 1 1 1 1 1 2  2   1 2  2  2  2 3 k  12 2 3 k k  12 1 1  2  k k  12 k  1  k 2  2 k k  1 2 k 2  k 1  2 k k  1 2 k2  k 1  2  k k  1 k k  1 2 2
  • 14. Proof: 1 1 1 1 1 1 1 1 2  2   1 2  2  2  2 3 k  12 2 3 k k  12 1 1  2  k k  12 k  1  k 2  2 k k  1 2 k 2  k 1  2 k k  1 2 k2  k 1  2  k k  1 k k  1 2 2 k k  1  2 k k  1 2
  • 15. Proof: 1 1 1 1 1 1 1 1 2  2   1 2  2  2  2 3 k  12 2 3 k k  12 1 1  2  k k  12 k  1  k 2  2 k k  1 2 k 2  k 1  2 k k  1 2 k2  k 1  2  k k  1 k k  1 2 2 k k  1  2 k k  1 2 1  2 k 1
  • 16. Proof: 1 1 1 1 1 1 1 1 2  2   1 2  2  2  2 3 k  12 2 3 k k  12 1 1  2  k k  12 k  1  k 2  2 k k  1 2 k 2  k 1  2 k k  1 2 k2  k 1  2  k k  1 k k  1 2 2 k k  1  2 k k  1 2 1  2 k 1 1 1 1 1 1  2  2     2 2 3 k  12 k 1
  • 17. (ii) A sequence is defined by; a1  2 an1  2  an for n  1 Show that an  2 for n  1
  • 18. (ii) A sequence is defined by; a1  2 an1  2  an for n  1 Show that an  2 for n  1 Test: n = 1
  • 19. (ii) A sequence is defined by; a1  2 an1  2  an for n  1 Show that an  2 for n  1 Test: n = 1 a1  2  2
  • 20. (ii) A sequence is defined by; a1  2 an1  2  an for n  1 Show that an  2 for n  1 Test: n = 1 a1  2  2 A n  k  ak  2
  • 21. (ii) A sequence is defined by; a1  2 an1  2  an for n  1 Show that an  2 for n  1 Test: n = 1 a1  2  2 A n  k  ak  2 P n  k  1 ak 1  2
  • 22. (ii) A sequence is defined by; a1  2 an1  2  an for n  1 Show that an  2 for n  1 Test: n = 1 a1  2  2 A n  k  ak  2 P n  k  1 ak 1  2 Proof:
  • 23. (ii) A sequence is defined by; a1  2 an1  2  an for n  1 Show that an  2 for n  1 Test: n = 1 a1  2  2 A n  k  ak  2 P n  k  1 ak 1  2 Proof: ak 1  2  ak
  • 24. (ii) A sequence is defined by; a1  2 an1  2  an for n  1 Show that an  2 for n  1 Test: n = 1 a1  2  2 A n  k  ak  2 P n  k  1 ak 1  2 Proof: ak 1  2  ak  22
  • 25. (ii) A sequence is defined by; a1  2 an1  2  an for n  1 Show that an  2 for n  1 Test: n = 1 a1  2  2 A n  k  ak  2 P n  k  1 ak 1  2 Proof: ak 1  2  ak  22  4 2
  • 26. (ii) A sequence is defined by; a1  2 an1  2  an for n  1 Show that an  2 for n  1 Test: n = 1 a1  2  2 A n  k  ak  2 P n  k  1 ak 1  2 Proof: ak 1  2  ak  22  4 2  ak 1  2
  • 27. iii The sequences xn and yn are defined by; xn  yn 2x y x1  5, y1  2 xn1  , yn1  n n 2 xn  yn Prove xn yn  10 for n  1
  • 28. iii The sequences xn and yn are defined by; xn  yn 2x y x1  5, y1  2 xn1  , yn1  n n 2 xn  yn Prove xn yn  10 for n  1 Test: n = 1
  • 29. iii The sequences xn and yn are defined by; xn  yn 2x y x1  5, y1  2 xn1  , yn1  n n 2 xn  yn Prove xn yn  10 for n  1 Test: n = 1 x1 y1  52  10
  • 30. iii The sequences xn and yn are defined by; xn  yn 2x y x1  5, y1  2 xn1  , yn1  n n 2 xn  yn Prove xn yn  10 for n  1 Test: n = 1 x1 y1  52  10 A n  k  xk yk  10
  • 31. iii The sequences xn and yn are defined by; xn  yn 2x y x1  5, y1  2 xn1  , yn1  n n 2 xn  yn Prove xn yn  10 for n  1 Test: n = 1 x1 y1  52  10 A n  k  xk yk  10 P n  k  1 xk 1 yk 1  10
  • 32. iii The sequences xn and yn are defined by; xn  yn 2x y x1  5, y1  2 xn1  , yn1  n n 2 xn  yn Prove xn yn  10 for n  1 Test: n = 1 x1 y1  52  10 A n  k  xk yk  10 P n  k  1 xk 1 yk 1  10 Proof:
  • 33. iii The sequences xn and yn are defined by; xn  yn 2x y x1  5, y1  2 xn1  , yn1  n n 2 xn  yn Prove xn yn  10 for n  1 Test: n = 1 x1 y1  52  10 A n  k  xk yk  10 P n  k  1 xk 1 yk 1  10 Proof:  xk  yk  2 xk yk  xk 1 yk 1    x  y    2  k k 
  • 34. iii The sequences xn and yn are defined by; xn  yn 2x y x1  5, y1  2 xn1  , yn1  n n 2 xn  yn Prove xn yn  10 for n  1 Test: n = 1 x1 y1  52  10 A n  k  xk yk  10 P n  k  1 xk 1 yk 1  10 Proof:  xk  yk  2 xk yk  xk 1 yk 1    x  y    2  k k   xk y k  10
  • 35. iii The sequences xn and yn are defined by; xn  yn 2x y x1  5, y1  2 xn1  , yn1  n n 2 xn  yn Prove xn yn  10 for n  1 Test: n = 1 x1 y1  52  10 A n  k  xk yk  10 P n  k  1 xk 1 yk 1  10 Proof:  xk  yk  2 xk yk  xk 1 yk 1    x  y    2  k k   xk y k  10  xk 1 yk 1  10
  • 36. (iv) The Fibonacci sequence is defined by; a1  a2  1 an1  an  an1 for n  1 n 1  5  Prove that an    for n  1  2 
  • 37. (iv) The Fibonacci sequence is defined by; a1  a2  1 an1  an  an1 for n  1 n 1  5  Prove that an    for n  1  2  Test: n = 1 and n =2
  • 38. (iv) The Fibonacci sequence is defined by; a1  a2  1 an1  an  an1 for n  1 n 1  5  Prove that an    for n  1  2  Test: n = 1 and n =2 L.H .S  a1 1
  • 39. (iv) The Fibonacci sequence is defined by; a1  a2  1 an1  an  an1 for n  1 n 1  5  Prove that an    for n  1  2  Test: n = 1 and n =2 1 1  5  L.H .S  a1 R.H .S     2  1  1.62
  • 40. (iv) The Fibonacci sequence is defined by; a1  a2  1 an1  an  an1 for n  1 n 1  5  Prove that an    for n  1  2  Test: n = 1 and n =2 1 1  5  L.H .S  a1 R.H .S     2  1  1.62  L.H .S  R.H .S
  • 41. (iv) The Fibonacci sequence is defined by; a1  a2  1 an1  an  an1 for n  1 n 1  5  Prove that an    for n  1  2  Test: n = 1 and n =2 1 1  5  L.H .S  a1 R.H .S     2  1  1.62  L.H .S  R.H .S L.H .S  a2 1
  • 42. (iv) The Fibonacci sequence is defined by; a1  a2  1 an1  an  an1 for n  1 n 1  5  Prove that an    for n  1  2  Test: n = 1 and n =2 1 1  5  L.H .S  a1 R.H .S     2  1  1.62  L.H .S  R.H .S 2 1  5  L.H .S  a2 R.H .S     2  1  2.62
  • 43. (iv) The Fibonacci sequence is defined by; a1  a2  1 an1  an  an1 for n  1 n 1  5  Prove that an    for n  1  2  Test: n = 1 and n =2 1 1  5  L.H .S  a1 R.H .S     2  1  1.62  L.H .S  R.H .S 2 1  5  L.H .S  a2 R.H .S     2  1  2.62  L.H .S  R.H .S
  • 44. (iv) The Fibonacci sequence is defined by; a1  a2  1 an1  an  an1 for n  1 n 1  5  Prove that an    for n  1  2  Test: n = 1 and n =2 1 1  5  L.H .S  a1 R.H .S     2  1  1.62  L.H .S  R.H .S 2 1  5  L.H .S  a2 R.H .S     2  1  2.62  L.H .S  R.H .S k 1 k 1  5  1  5  A n  k  1 & n  k  ak 1    & ak     2   2 
  • 45. (iv) The Fibonacci sequence is defined by; a1  a2  1 an1  an  an1 for n  1 n 1  5  Prove that an    for n  1  2  Test: n = 1 and n =2 1 1  5  L.H .S  a1 R.H .S     2  1  1.62  L.H .S  R.H .S 2 1  5  L.H .S  a2 R.H .S     2  1  2.62  L.H .S  R.H .S k 1 k 1  5  1  5  A n  k  1 & n  k  ak 1    & ak     2   2  k 1 1  5  P n  k  1 ak 1     2 
  • 46. Proof: ak 1  ak  ak 1
  • 47. Proof: ak 1  ak  ak 1 k k 1 1  5  1  5       2   2 
  • 48. Proof: ak 1  ak  ak 1 k k 1 1  5  1  5      2   2  k 1 1 2  1  5   1  5 1  5           2   2    2   
  • 49. Proof: ak 1  ak  ak 1 k k 1 1  5  1 5      2   2  k 1 1 2  1  5   1  5 1  5           2   2    2    k 1 1  5   2 4      2  2  1  5 1  5  
  • 50. Proof: ak 1  ak  ak 1 k k 1 1  5  1  5      2   2  k 1 1 2  1  5   1  5 1  5           2   2    2    k 1 1  5  2 4      2  2  1  5 1  5   k 1 1  5  2  2 5  4    2   2   1  5   k 1 1  5  62 5     2  2   1  5  
  • 51. Proof: ak 1  ak  ak 1 k k 1 1  5  1  5      2   2  k 1 1 2  1  5   1  5 1  5           2   2    2    k 1 1  5  2 4      2  2  1  5 1  5   k 1 1  5  2  2 5  4    2   2   1  5   k 1 1  5   6  2 5       2   1  5 2  k 1 1  5     2 
  • 52. Proof: ak 1  ak  ak 1 k k 1 1  5  1  5      2   2  k 1 1 2  1  5   1  5 1  5           2   2    2    k 1 1  5  2 4      2  2  1  5 1  5   k 1 1  5  2  2 5  4    2   2   1  5   k 1 1  5   6  2 5       2   1  5 2  k 1 1  5     2  k 1 1  5   ak 1     2 
  • 53. Proof: ak 1  ak  ak 1 k k 1 1  5  1  5      2   2  k 1 1 2  1  5   1  5 1  5           2   2    2    k 1 1  5  2 4  Sheets     2  2  1  5 1  5   k 1 + 1  5  2  2 5  4    2   2   1  5   Exercise 10E* k 1 1  5   6  2 5       2   1  5 2  k 1 1  5     2  k 1 1  5   ak 1     2 