Chapter 2

Calculus for Biology and Medicine · 189 exercises

Problem 42

In Problems , find the population sizes for \(t=0,1,2, \ldots, 5\) for each recursion. $$ N_{t+1}=\frac{1}{2} N_{t} \text { with } N_{0}=4096 $$

7 step solution

Problem 42

Write the first five terms of the sequence \(\left\\{a_{n}\right\\}\), \(n=0,1,2,3, \ldots\), and find \(\lim _{n \rightarrow \infty} a_{n}\). $$ a_{n}=\frac{1}{\sqrt{n+1}} $$

6 step solution

Problem 43

Investigate the behavior of the discrete logistic equation $$ x_{t+1}=r x_{t}\left(1-x_{t}\right) $$ Compute \(x_{t}\) for \(t=0,1,2, \ldots, 20\) for the given values of \(r\) and \(x_{0}\), and graph \(x_{t}\) as a function of \(t\). \(r=3.8, x_{0}=0.5\)

5 step solution

Problem 43

In Problems , find the population sizes for \(t=0,1,2, \ldots, 5\) for each recursion. $$ N_{t+1}=\frac{1}{3} N_{t} \text { with } N_{0}=729 $$

6 step solution

Problem 43

Write the first five terms of the sequence \(\left\\{a_{n}\right\\}\), \(n=0,1,2,3, \ldots\), and find \(\lim _{n \rightarrow \infty} a_{n}\). $$ a_{n}=\frac{(-1)^{n}}{n+1} $$

6 step solution

Problem 44

Investigate the behavior of the discrete logistic equation $$ x_{t+1}=r x_{t}\left(1-x_{t}\right) $$ Compute \(x_{t}\) for \(t=0,1,2, \ldots, 20\) for the given values of \(r\) and \(x_{0}\), and graph \(x_{t}\) as a function of \(t\). \(r=3.8, x_{0}=0.1\)

5 step solution

Problem 44

In Problems , find the population sizes for \(t=0,1,2, \ldots, 5\) for each recursion. $$ N_{t+1}=\frac{1}{3} N_{t} \text { with } N_{0}=3645 $$

7 step solution

Problem 44

Write the first five terms of the sequence \(\left\\{a_{n}\right\\}\), \(n=0,1,2,3, \ldots\), and find \(\lim _{n \rightarrow \infty} a_{n}\). $$ a_{n}=\frac{(-1)^{n}}{n^{3}+3} $$

7 step solution

Problem 45

Investigate the behavior of the discrete logistic equation $$ x_{t+1}=r x_{t}\left(1-x_{t}\right) $$ Compute \(x_{t}\) for \(t=0,1,2, \ldots, 20\) for the given values of \(r\) and \(x_{0}\), and graph \(x_{t}\) as a function of \(t\). \(r=3.8, x_{0}=0.9\)

6 step solution

Problem 45

In Problems , find the population sizes for \(t=0,1,2, \ldots, 5\) for each recursion. $$ N_{t+1}=\frac{1}{5} N_{t} \text { with } N_{0}=31250 $$

7 step solution

Problem 45

In Problems \(45-52\), write the first five terms of the sequence \(\left\\{a_{n}\right\\}\), \(n=0,1,2,3, \ldots\), and determine whether \(\lim _{n \rightarrow \infty} a_{n}\) exists. If the limit exists, find it. $$ a_{n}=\frac{n^{2}}{n+1} $$

6 step solution

Problem 46

Investigate the behavior of the discrete logistic equation $$ x_{t+1}=r x_{t}\left(1-x_{t}\right) $$ Compute \(x_{t}\) for \(t=0,1,2, \ldots, 20\) for the given values of \(r\) and \(x_{0}\), and graph \(x_{t}\) as a function of \(t\). \(r=3.8, x_{0}=0\)

4 step solution

Problem 46

In Problems , find the population sizes for \(t=0,1,2, \ldots, 5\) for each recursion. $$ N_{t+1}=\frac{1}{4} N_{t} \text { with } N_{0}=8192 $$

8 step solution

Problem 46

Write the first five terms of the sequence \(\left\\{a_{n}\right\\}\), \(n=0,1,2,3, \ldots\), and determine whether \(\lim _{n \rightarrow \infty} a_{n}\) exists. If the limit exists, find it. $$ a_{n}=\frac{n^{3}}{n+1} $$

7 step solution

Problem 47

$$ \text { In Problems } \text { , write } N_{t} \text { as a function of } t \text { for each recursion } $$ $$ N_{t+1}=2 N_{t} \text { with } N_{0}=15 $$

5 step solution

Problem 47

Write the first five terms of the sequence \(\left\\{a_{n}\right\\}\), \(n=0,1,2,3, \ldots\), and determine whether \(\lim _{n \rightarrow \infty} a_{n}\) exists. If the limit exists, find it. $$ a_{n}=\sqrt{n} $$

2 step solution

Problem 48

Graph the Ricker's curve $$ N_{t+1}=N_{t} \exp \left[R\left(1-\frac{N_{t}}{K}\right)\right] $$ in the \(N_{t}-N_{t+1}\) plane for the given values of \(R\) and \(\bar{K} .\) Find the points of intersection of this graph with the line \(N_{t+1}=N_{t}\). R=3, K=15

6 step solution

Problem 48

$$ \text { In Problems } \text { , write } N_{t} \text { as a function of } t \text { for each recursion } $$ $$ N_{t+1}=2 N_{t} \text { with } N_{0}=7 $$

4 step solution

Problem 48

Write the first five terms of the sequence \(\left\\{a_{n}\right\\}\), \(n=0,1,2,3, \ldots\), and determine whether \(\lim _{n \rightarrow \infty} a_{n}\) exists. If the limit exists, find it. $$ a_{n}=n^{2} $$

4 step solution

Problem 49

Graph the Ricker's curve $$ N_{t+1}=N_{t} \exp \left[R\left(1-\frac{N_{t}}{K}\right)\right] $$ in the \(N_{t}-N_{t+1}\) plane for the given values of \(R\) and \(\bar{K} .\) Find the points of intersection of this graph with the line \(N_{t+1}=N_{t}\). R=2.5, K=12

5 step solution

Problem 49

$$ \text { In Problems } \text { , write } N_{t} \text { as a function of } t \text { for each recursion } $$ $$ N_{t+1}=3 N_{t} \text { with } N_{0}=12 $$

5 step solution

Problem 49

Write the first five terms of the sequence \(\left\\{a_{n}\right\\}\), \(n=0,1,2,3, \ldots\), and determine whether \(\lim _{n \rightarrow \infty} a_{n}\) exists. If the limit exists, find it. $$ a_{n}=2^{n} $$

9 step solution

Problem 50

Graph the Ricker's curve $$ N_{t+1}=N_{t} \exp \left[R\left(1-\frac{N_{t}}{K}\right)\right] $$ in the \(N_{t}-N_{t+1}\) plane for the given values of \(R\) and \(\bar{K} .\) Find the points of intersection of this graph with the line \(N_{t+1}=N_{t}\). R=4, K=20

5 step solution

Problem 50

$$ \text { In Problems } \text { , write } N_{t} \text { as a function of } t \text { for each recursion } $$ $$ N_{t+1}=3 N_{t} \text { with } N_{0}=3 $$

5 step solution

Problem 50

Write the first five terms of the sequence \(\left\\{a_{n}\right\\}\), \(n=0,1,2,3, \ldots\), and determine whether \(\lim _{n \rightarrow \infty} a_{n}\) exists. If the limit exists, find it. $$ a_{n}=\left(\frac{1}{2}\right)^{n} $$

4 step solution

Problem 51

Investigate the behavior ofthe Ricker's curve $$ N_{t+1}=N_{f} \exp \left[R\left(1-\frac{N_{t}}{K}\right)\right] $$ Compute \(N_{t}\) for \(t=1,2, \ldots, 20\) for the given values of \(R, K\), and \(N_{0}\), and graph \(N_{t}\) as a function of \(t\). (a) \(R=1, K=20, N_{0}=5\) (b) \(R=1, K=20, N_{0}=10\) (c) \(R=1, K=20, N_{0}=20\) (d) \(R=1, K=20, N_{0}=0\)

5 step solution

Problem 51

$$ \text { In Problems } \text { , write } N_{t} \text { as a function of } t \text { for each recursion } $$ $$ N_{t+1}=4 N_{t} \text { with } N_{0}=24 $$

5 step solution

Problem 51

Write the first five terms of the sequence \(\left\\{a_{n}\right\\}\), \(n=0,1,2,3, \ldots\), and determine whether \(\lim _{n \rightarrow \infty} a_{n}\) exists. If the limit exists, find it. $$ a_{n}=3^{n} $$

2 step solution

Problem 52

Investigate the behavior ofthe Ricker's curve $$ N_{t+1}=N_{f} \exp \left[R\left(1-\frac{N_{t}}{K}\right)\right] $$ Compute \(N_{t}\) for \(t=1,2, \ldots, 20\) for the given values of \(R, K\), and \(N_{0}\), and graph \(N_{t}\) as a function of \(t\). (a) \(R=1.8, K=20, N_{0}=5\) (b) \(R=1.8, K=20, N_{0}=10\) (c) \(R=1.8, K=20, N_{0}=20\) (d) \(R=1.8, K=20, N_{0}=0\)

5 step solution

Problem 52

$$ \text { In Problems } \text { , write } N_{t} \text { as a function of } t \text { for each recursion } $$ $$ N_{t+1}=5 N_{t} \text { with } N_{0}=17 $$

4 step solution

Problem 52

Write the first five terms of the sequence \(\left\\{a_{n}\right\\}\), \(n=0,1,2,3, \ldots\), and determine whether \(\lim _{n \rightarrow \infty} a_{n}\) exists. If the limit exists, find it. $$ a_{n}=\left(\frac{1}{3}\right)^{n} $$

4 step solution

Problem 53

$$ \text { In Problems } \text { , write } N_{t} \text { as a function of } t \text { for each recursion } $$ $$ N_{t+1}=\frac{1}{2} N_{t} \text { with } N_{0}=5000 $$

4 step solution

Problem 53

Formal Definition of Limits: In Problems \(53-64, \lim _{n \rightarrow \infty} a_{n}=a .\) Find the limit \(a\), and determine \(N\) so that \(\left|a_{n}-a\right|<\epsilon\) for all \(n>N\) for the given value of \(\epsilon\). $$ a_{n}=\frac{1}{n}, \epsilon=0.01 $$

5 step solution

Problem 54

Investigate the behavior ofthe Ricker's curve $$ N_{t+1}=N_{f} \exp \left[R\left(1-\frac{N_{t}}{K}\right)\right] $$ Compute \(N_{t}\) for \(t=1,2, \ldots, 20\) for the given values of \(R, K\), and \(N_{0}\), and graph \(N_{t}\) as a function of \(t\). (a) \(R=2.8, K=20, N_{0}=5\) (b) \(R=2.8, K=20, N_{0}=10\) (c) \(R=2.8, K=20, N_{0}=20\) (d) \(R=2.8, K=20, N_{0}=0\)

6 step solution

Problem 54

$$ \text { In Problems } \text { , write } N_{t} \text { as a function of } t \text { for each recursion } $$ $$ N_{t+1}=\frac{1}{2} N_{t} \text { with } N_{0}=2300 $$

4 step solution

Problem 54

Formal Definition of Limits: \lim _{n \rightarrow \infty} a_{n}=a .\( Find the limit \)a\(, and determine \)N\( so that \)\left|a_{n}-a\right|<\epsilon\( for all \)n>N\( for the given value of \)\epsilon$. $$ a_{n}=\frac{1}{n}, \epsilon=0.02 $$

4 step solution

Problem 55

Compute \(N_{t}\) and \(N_{t} / N_{t-1}\) for \(t=2,3,4, \ldots, 20\) when $$ N_{t+1}=N_{t}+N_{t-1} $$ with \(N_{0}=1\) and \(N_{1}=1\).

3 step solution

Problem 55

$$ \text { In Problems } \text { , write } N_{t} \text { as a function of } t \text { for each recursion } $$ $$ N_{t+1}=\frac{1}{3} N_{t} \text { with } N_{0}=8000 $$

4 step solution

Problem 55

Formal Definition of Limits: \lim _{n \rightarrow \infty} a_{n}=a .\( Find the limit \)a\(, and determine \)N\( so that \)\left|a_{n}-a\right|<\epsilon\( for all \)n>N\( for the given value of \)\epsilon$. $$ a_{n}=\frac{1}{n^{2}}, \epsilon=0.01 $$

3 step solution

Problem 56

Compute \(N_{t}\) and \(N_{t} / N_{t-1}\) for \(t=2,3,4, \ldots .20\) when $$ N_{t+1}=N_{t}+2 N_{t-1} $$ with \(N_{0}=1\) and \(N_{1}=1\).

10 step solution

Problem 56

$$ \text { In Problems } \text { , write } N_{t} \text { as a function of } t \text { for each recursion } $$ $$ N_{t+1}=\frac{1}{3} N_{t} \text { with } N_{0}=3500 $$

4 step solution

Problem 56

Formal Definition of Limits: \lim _{n \rightarrow \infty} a_{n}=a .\( Find the limit \)a\(, and determine \)N\( so that \)\left|a_{n}-a\right|<\epsilon\( for all \)n>N\( for the given value of \)\epsilon$. $$ a_{n}=\frac{1}{n^{2}}, \epsilon=0.001 $$

4 step solution

Problem 57

Formal Definition of Limits: \lim _{n \rightarrow \infty} a_{n}=a .\( Find the limit \)a\(, and determine \)N\( so that \)\left|a_{n}-a\right|<\epsilon\( for all \)n>N\( for the given value of \)\epsilon$. $$ a_{n}=\frac{1}{\sqrt{n}}, \epsilon=0.1 $$

4 step solution

Problem 58

$$ \text { In Problems } \text { , write } N_{t} \text { as a function of } t \text { for each recursion } $$ $$ N_{t+1}=\frac{1}{7} N_{t} \text { with } N_{0}=6400 $$

4 step solution

Problem 58

Formal Definition of Limits: \lim _{n \rightarrow \infty} a_{n}=a .\( Find the limit \)a\(, and determine \)N\( so that \)\left|a_{n}-a\right|<\epsilon\( for all \)n>N\( for the given value of \)\epsilon$. $$ a_{n}=\frac{1}{\sqrt{n}}, \epsilon=0.05 $$

3 step solution

Problem 59

Formal Definition of Limits: \lim _{n \rightarrow \infty} a_{n}=a .\( Find the limit \)a\(, and determine \)N\( so that \)\left|a_{n}-a\right|<\epsilon\( for all \)n>N\( for the given value of \)\epsilon$. $$ a_{n}=\frac{(-1)^{n}}{n}, \epsilon=0.01 $$

5 step solution

Problem 60

In Problems , graph the line \(N_{t+1}=R N_{t}\) in the \(N_{t}-N_{t+1}\) plane for the indicated value of \(R\) and locate the points \(\left(N_{t}, N_{t+1}\right), t=0\), 1\. and 2. for the given value of \(N_{0}\). $$ R=2, N_{0}=3 $$

4 step solution

Problem 60

Formal Definition of Limits: \lim _{n \rightarrow \infty} a_{n}=a .\( Find the limit \)a\(, and determine \)N\( so that \)\left|a_{n}-a\right|<\epsilon\( for all \)n>N\( for the given value of \)\epsilon$. $$ a_{n}=\frac{(-1)^{n}}{n}, \epsilon=.001 $$

5 step solution

Problem 61

Formal Definition of Limits: \lim _{n \rightarrow \infty} a_{n}=a .\( Find the limit \)a\(, and determine \)N\( so that \)\left|a_{n}-a\right|<\epsilon\( for all \)n>N\( for the given value of \)\epsilon$. $$ a_{n}=\frac{n}{n+1}, \epsilon=0.01 $$

3 step solution

Problem 62

In Problems , graph the line \(N_{t+1}=R N_{t}\) in the \(N_{t}-N_{t+1}\) plane for the indicated value of \(R\) and locate the points \(\left(N_{t}, N_{t+1}\right), t=0\), 1\. and 2. for the given value of \(N_{0}\). $$ R=4, N_{0}=2 $$

4 step solution

Show/ page