/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Free solutions & answers for Calculus Volume 2 (2016) Chapter 5 - (Page 2) [step by step] | 91Ó°ÊÓ

91Ó°ÊÓ

Problem 11

Find an explicit formula for the \(n\) th term of the sequence satisfying \(a_{1}=0\) and \(a_{n}=2 a_{n-1}+1\) for \(n \geq 2\).

Problem 12

Find a formula for the general term \(a_{n}\) of each of the following sequences. \(\\{1,0,-1,0,1,0,-1,0, \ldots\\}\)

Problem 13

Find a formula for the general term \(a_{n}\) of each of the following sequences. \(\\{1,-1 / 3,1 / 5,-1 / 7, \ldots\\}\)

Problem 14

Find a function \(f(n)\) that identifies the \(n\) th term \(a_{n}\) of the following recursively defined sequences, as \(a_{n}=f(n)\). \(a_{1}=1\) and \(a_{n+1}=-a_{n}\) for \(n \geq 1\)

Problem 15

Find a function \(f(n)\) that identifies the \(n\) th term \(a_{n}\) of the following recursively defined sequences, as \(a_{n}=f(n)\). \(a_{1}=2\) and \(a_{n+1}=2 a_{n}\) for \(n \geq 1\)

Problem 16

Find a function \(f(n)\) that identifies the \(n\) th term \(a_{n}\) of the following recursively defined sequences, as \(a_{n}=f(n)\). \(a_{1}=1\) and \(a_{n+1}=(n+1) a_{n}\) for \(n \geq 1\)

Problem 17

Find a function \(f(n)\) that identifies the \(n\) th term \(a_{n}\) of the following recursively defined sequences, as \(a_{n}=f(n)\). \(a_{1}=2\) and \(a_{n+1}=(n+1) a_{n} / 2\) for \(n \geq 1\)

Problem 18

Find a function \(f(n)\) that identifies the \(n\) th term \(a_{n}\) of the following recursively defined sequences, as \(a_{n}=f(n)\). \(a_{1}=1\) and \(a_{n+1}=a_{n} / 2^{n}\) for \(n \geq 1\)

Problem 19

Plot the first \(N\) terms of each sequence. State whether the graphical evidence suggests that the sequence converges or diverges. [T] \(a_{1}=1, \quad a_{2}=2, \quad\) and for \(\quad n \geq 2,\) \(a_{n}=\frac{1}{2}\left(a_{n-1}+a_{n-2}\right) ; \quad N=30\)

Problem 20

Plot the first \(N\) terms of each sequence. State whether the graphical evidence suggests that the sequence converges or diverges. [T] \(a_{1}=1, \quad a_{2}=2, \quad a_{3}=3\) and for \(n \geq 4,\) \(a_{n}=\frac{1}{3}\left(a_{n-1}+a_{n-2}+a_{n-3}\right), \quad N=30\)

Access millions of textbook solutions in one place

  • Access over 3 million high quality textbook solutions
  • Access our popular flashcard, quiz, mock-exam and notes features
  • Access our smart AI features to upgrade your learning
Access millions of textbook solutions in one place

Recommended explanations on Math Textbooks