Proving convergence of: ∑ n = 0 ∞ cos ⁡ ( n π ) 3 n ! + 1

Question

Proving convergence of:      ∑          n      =      0              ∞                  cos      ⁡              (        n        π        )                    3      n      !      +      1

Johnathan Morse · Accepted Answer

|        a    n        |    ≤      b    n    =      1          n      !        .Therefore since the sum       ∑          n      =      0              ∞            b    n   converges, the given sum converges as well.For the amount of terms, needed for accuracy 0.01, it is better to rewrite the sum as follows:      ∑          n      =      0              ∞            a    n    =  ∑  E  v  e  n     n  +  ∑  O  d  d     n  =      ∑          n      =      0        ∞        1          3      (      2      n      )      !        +      ∑          n      =      0        ∞              −      1              3      (      2      n      +      1      )      !        =      ∑          n      =      0        ∞              2      n      +      1      −      1              3      (      2      n      +      1      )      !        =      ∑          n      =      0        ∞              2      n              3      (      2      n      +      1      )      !        =      ∑          n      =      0        ∞        a    n    ∗  Now all summands are positive, so the sum only increases. We need to examine the rate of change of the sum and of the summands, in order to be able to make a proper guess about N - the number of summands needed to have the needed accuracy. These rates of change are:      Δ    ∑    =      a    n    ∗    =            2      n              3      (      2      n      +      1      )      !            Δ                  a        n        ∗              =      a    n    ∗    −      a          n      −      1        ∗    =            2      n              3      (      2      n      +      1      )      !        −            2      n      −      2              3      (      2      n      −      1      )      !        =      2    3        [          n              (        2        n        +        1        )        !              −                  (        n        −        1        )        (        2        n        )        (        2        n        +        1        )                    (        2        n        +        1        )        !              ]    =      2    3              −      4              n        3            +      4              n        2            +      3      n              (      2      n      +      1      )      !      To be sure that the sum won&#039;t increrase with more than 0.01 after   n  =  N, we can look for the n, satisfying       Δ                  a        n        ∗              ≤  0.001. By guess and check one sees that the first such n is n=4. But let&#039;s not forget that       a    n    ∗    =      a          2      n        +      a          2      n      +      1       and:      ∑          n      =      0        N        a    n    ∗    =      ∑          n      =      0              2      N            a    n  so we have to sum up at most   2  ∗  4  =  8 members of   {  a      }    n   to get accuracy up to second decimal place.However it should be noted that this is a very rough method and higher accuracies will require much less summands than what can be estimated with this method. To achieve accuracy 0.01 are in fact needed only six summands.

Proving convergence of: <munderover> ∑ <mrow class="MJX-TeXAtom-ORD">

Answered question

Answer & Explanation

New Questions in Calculus 2