Skip to main content
Mathematics LibreTexts

3.1E: Exercises

  • Page ID
    128860
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

    ( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\id}{\mathrm{id}}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\kernel}{\mathrm{null}\,}\)

    \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\)

    \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\)

    \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    \( \newcommand{\vectorA}[1]{\vec{#1}}      % arrow\)

    \( \newcommand{\vectorAt}[1]{\vec{\text{#1}}}      % arrow\)

    \( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vectorC}[1]{\textbf{#1}} \)

    \( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

    \( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

    \( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

    \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    In exercises 1 - 4, find the first six terms of each sequence, starting with \( n=1\).

    1) \(a_n=1+(−1)^n\) for \( n \geq 1\)

    Answer
    \( a_n=0\) if \( n\) is odd and \( a_n=2\) if \( n\) is even

    2) \( a_n=n^2−1\) for \( n \geq 1\)

    3) \( a_1=1\) and \( a_n=a_{n−1}+n\) for \( n \geq 2\)

    Answer
    \( {a_n}={1,3,6,10,15,21, \ldots }\)

    4) \( a_1=1, a_2=1\) and \( a_n+2=a_n+a_{n+1}\) for \( n \geq 1\)

    5) Find an explicit formula for \( a_n\) where \( a_1=1\) and \( a_n=a_{n−1}+n\) for \( n \geq 2\).

    Answer
    \( a_n=\dfrac{n(n+1)}{2}\)

    6) Find a formula \( a_n\) for the \(n^{\text{th}}\) term of the arithmetic sequence whose first term is \( a_1=1\) such that \( a_{n−1}−a_n=17\) for \( n \geq 1\).

    7) Find a formula \( a_n\) for the \(n^{\text{th}}\) term of the arithmetic sequence whose first term is \( a_1=−3\) such that \( a_{n−1}−a_n=4\) for \( n \geq 1\).

    Answer
    \( a_n=4n−7\)

    8) Find a formula \( a_n\) for the \(n^{\text{th}}\) term of the geometric sequence whose first term is \( a_1=1\) such that \( \dfrac{a_{n+1}}{a_n}=10\) for \( n \geq 1\).

    9) Find a formula \( a_n\) for the \(n^{\text{th}}\) term of the geometric sequence whose first term is \( a_1=3\) such that \( \dfrac{a_{n+1}}{a_n}=1/10\) for \( n \geq 1\).

    Answer
    \( a_n=3.10^{1−n}=30.10^{−n}\)

    10) Find an explicit formula for the \(n^{\text{th}}\) term of the sequence whose first several terms are \( {0,3,8,15,24,35,48,63,80,99, \ldots }.\) (Hint: First add one to each term.)

    11) Find an explicit formula for the \(n^{\text{th}}\) term of the sequence satisfying \( a_1=0\) and \( a_n=2a_{n−1}+1\) for \( n \geq 2\).

    Answer
    \( a_n=2^n−1\)

    In exercises 12 and 13, find a formula for the general term \( a_n\) of each of the following sequences.

    12) \( {1,0,−1,0,1,0,−1,0, \ldots }\) (Hint: Find where \(\sin x\) takes these values)

    13) \( {1,−1/3,1/5,−1/7, \ldots }\)

    Answer
    \( a_n=\dfrac{(−1)^{n−1}}{2n−1}\)

    In exercises 14-18, find a function \( f(n)\) that identifies the \(n^{\text{th}}\) term \( a_n\) of the following recursively defined sequences, as \( a_n=f(n)\).

    14) \( a_1=1\) and \( a_{n+1}=−a_n\) for \( n \geq 1\)

    15) \( a_1=2\) and \( a_{n+1}=2a_n\) for \( n \geq 1\)

    Answer
    \( f(n)=2^n\)

    16) \( a_1=1\) and \( a_{n+1}=(n+1)a_n\) for \( n \geq 1\)

    17) \( a_1=2\) and \( a_{n+1}=(n+1)a_n/2\) for \( n \geq 1\)

    Answer
    \(f(n)=\dfrac{n!}{2^{n-2}}\)

    18) \( a_1=1\) and \( a_{n+1}=a_n/2^n\) for \( n \geq 1\)

    In exercises 19 - 22, plot the first \( N\) terms of the given sequence. State whether the graphical evidence suggests that the sequence converges or diverges.

    19) [Technology Required] \( a_1=1, a_2=2\), and for \( n \geq 2, a_n=\frac{1}{2}(a_{n−1}+a_{n−2})\); \( N=30\)

    20) [Technology Required] \( a_1=1, a_2=2, a_3=3\) and for \( n \geq 4, a_n=\frac{1}{3}(a_{n−1}+a_{n−2}+a_{n−3}), N=30\)

    21) [Technology Required] \( a_1=1, a_2=2\), and for \( n \geq 3, a_n=\sqrt{a_{n−1}a_{n−2}}; N=30\)

    22) [Technology Required] \( a_1=1, a_2=2, a_3=3\), and for \( n \geq 4, a_n=\sqrt{a_{n−1}a_{n−2}a_{n−3}}; N=30\)

    In exercises 23 - 16, suppose that \(\displaystyle \lim_{n \to \infty }a_n=1, \) \(\displaystyle \lim_{n \to \infty }b_n=−1\), and \( 0<−b_n<a_n\) for all \( n\).

    Using this information, evaluate each of the following limits, state that the limit does not exist, or state that there is not enough information to determine whether the limit exists.

    23) \(\displaystyle \lim_{n \to \infty }3a_n−4b_n\)

    Answer
    \(\displaystyle \lim_{n \to \infty }3a_n−4b_n \quad = \quad 7\)

    24) \(\displaystyle \lim_{n \to \infty }\frac{1}{2}b_n−\frac{1}{2}a_n\)

    25) \(\displaystyle \lim_{n \to \infty }\frac{a_n+b_n}{a_n−b_n}\)

    Answer
    \(\displaystyle \lim_{n \to \infty }\frac{a_n+b_n}{a_n−b_n} \quad = \quad 0\)

    26) \(\displaystyle \lim_{n \to \infty }\frac{a_n−b_n}{a_n+b_n}\)

    In exercises 27 - 30, find the limit of each of the following sequences, using L’Hôpital’s rule when appropriate.

    27) \( \dfrac{n^2}{2^n}\)

    Answer
    \(\displaystyle \lim_{n \to \infty } \dfrac{n^2}{2^n} \quad = \quad 0\)

    28) \( \dfrac{(n−1)^2}{(n+1)^2}\)

    29) \( \dfrac{\sqrt{n}}{\sqrt{n+1}}\)

    Answer
    \(\displaystyle \lim_{n \to \infty } \dfrac{\sqrt{n}}{\sqrt{n+1}} \quad = \quad 1 \)

    30) \( n^{1/n}\) (Hint: \( n^{1/n}=e^{\frac{1}{n}\ln n})\)

    In exercises 31 - 37, state whether each sequence is bounded and whether it is eventually monotone, increasing, or decreasing.

    31) \( n/2^n, n \geq 2\)

    Answer
    bounded, decreasing for \( n \geq 1\)

    32) \( \ln\left(1+\dfrac{1}{n}\right)\)

    33) \( \sin n\)

    Answer
    bounded, not monotone

    34) \( \cos(n^2)\)

    35) \( n^{1/n}, \quad n \geq 3\)

    Answer
    bounded, decreasing

    36) \( n^{−1/n}, \quad n \geq 3\)

    37) \( \tan n\)

    Answer
    not monotone, not bounded

    In exercises 38 - 39, determine whether the given sequence has a limit. If it does, find the limit.

    38) \( a_1=\sqrt{2}, a_2=\sqrt{2\sqrt{2}}. a_3=\sqrt{2\sqrt{2\sqrt{2}}}\) etc.

    39) \( a_1=3, a_n=\sqrt{2a_{n−1}}, n=2,3, \ldots .\)

    Answer
    \( a_n\) is decreasing and bounded below by \(2\). The limit a must satisfy \( a=\sqrt{2a}\) so \( a=2\), independent of the initial value.

    Use the Squeeze Theorem to find the limit of each sequence in exercises 40 - 43.

    40) \( n\sin(1/n)\)

    41) \( \dfrac{\cos(1/n)−1}{1/n}\)

    Answer
    \(0\)

    42) \( a_n=\dfrac{n!}{n^n}\)

    43) \( a_n=\sin n \sin(1/n)\)

    Answer
    \( 0\) since \(|\sin x| \leq |x|\) and \( |\sin x| \leq 1\) so \( −\dfrac{1}{n} \leq a_n \leq \dfrac{1}{n})\).

    For the sequences in exercises 44 and 45, plot the first \( 25\) terms of the sequence and state whether the graphical evidence suggests that the sequence converges or diverges.

    44) [Technology Required] \( a_n=\sin n\)

    45) [Technology Required] \( a_n=\cos n\)

    In exercises 46 - 52, determine the limit of the sequence or show that the sequence diverges. If it converges, find its limit.

    46) \( a_n=\tan^{−1}(n^2)\)

    47) \( a_n=(2n)^{1/n}−n^{1/n}\)

    Answer
    \( n^{1/n} \to 1\) and \( 2^{1/n} \to 1,\) so \( a_n \to 0\)

    48) \( a_n=\dfrac{\ln(n^2)}{\ln(2n)}\)

    49) \( a_n=\left(1−\frac{2}{n}\right)^n\)

    Answer
    Since \( (1+1/n)^n \to e\), one has \( (1−2/n)^n \approx (1+k)^{−2k} \to e^{−2}\) as \( k \to \infty .\)

    50) \( a_n=\ln\left(\dfrac{n+2}{n^2−3}\right)\)

    51) \( a_n=\dfrac{2^n+3^n}{4^n}\)

    Answer
    \( 2^n+3^n \leq 2 \cdot 3^n\) and \( 3^n/4^n \to 0\) as \( n \to \infty \), so \( a_n \to 0\) as \( n \to \infty .\)

    52) \( a_n=\dfrac{(1000)^n}{n!}\)

    53) \( a_n=\dfrac{(n!)^2}{(2n)!}\)

    Answer
    \( \dfrac{a_{n+1}}{a_n}=n!/(n+1)(n+2) \cdots (2n) =\dfrac{1 \cdot 2 \cdot 3 \cdots n}{(n+1)(n+2) \cdots (2n)}<1/2^n\). In particular, \( a_{n+1}/a_n \leq 1/2\), so \( a_n \to 0\) as \( n \to \infty \).

    Newton’s method seeks to approximate a solution \( f(x)=0\) that starts with an initial approximation \( x_0\) and successively defines a sequence \( x_{n+1}=x_n−\dfrac{f(x_n)}{f^{\prime}(x_n)}\). For the given choice of \( f\) and \( x_0\), write out the formula for \( x_{n+1}\). If the sequence appears to converge, give an exact formula for the solution \( x\), then identify the limit \( x\) accurate to four decimal places and the smallest \( n\) such that \( x_n\) agrees with \( x\) up to four decimal places.

    54) [Technology Required] \( f(x)=x^2−2,\quad x_0=1\)

    55) [Technology Required] \( f(x)=(x−1)^2−2,\quad x_0=2\)

    Answer
    \( x_{n+1}=x_n−((x_n−1)^2−2)/2(x_n−1); \;
    x=1+\sqrt{2}, \; x \approx 2.4142, \; n=5\)

    56) [Technology Required] \( f(x)=e^x−2, \quad x_0=1\)

    57) [Technology Required] \( f(x)=\ln x−1,\quad x_0=2\)

    Answer
    \( x_{n+1}=x_n−x_n(\ln(x_n)−1); \;
    x=e, \;x \approx 2.7183, \; n=5\)

    58) [Technology Required] Suppose you start with one liter of vinegar and repeatedly remove \(0.1\) L, replace with water, mix, and repeat.

    a. Find a formula for the concentration after \( n\) steps.

    b. After how many steps does the mixture contain less than \( 10\%\) vinegar?

    59) [Technology Required] A lake initially contains \( 2000\) fish. Suppose that in the absence of predators or other causes of removal, the fish population increases by \( 6\%\) each month. However, factoring in all causes, \( 150\) fish are lost each month.

    a. Explain why the fish population after \( n\) months is modeled by \( P_n=1.06P_{n−1}−150\) with \( P_0=2000\).

    b. How many fish will be in the pond after one year?

    Answer
    a. Without losses, the population would obey \( P_n=1.06P_{n−1}\). The subtraction of \( 150\) accounts for fish losses.
    b. After \( 12\) months, we have \( P_{12} \approx 1494.\)

    60) [Technology Required] A bank account earns \( 5\%\) interest compounded monthly. Suppose that \( $1000\) is initially deposited into the account, but that \( $10\) is withdrawn each month.

    a. Show that the amount in the account after \( n\) months is \( A_n=(1+.05/12)A_{n−1}−10; \; A_0=1000.\)

    b. How much money will be in the account after \( 1\) year?

    c. Is the amount increasing or decreasing?

    d. Suppose that instead of \( $10\), a fixed amount \( d\) dollars is withdrawn each month. Find a value of \( d\) such that the amount in the account after each month remains \( $1000\).

    e. What happens if \( d\) is greater than this amount?

    61) [Technology Required] A student takes out a college loan of \( $10,000\) at an annual percentage rate of \( 6\%,\) compounded monthly.

    a. If the student makes payments of \( $100\) per month, how much does the student owe after \( 12\) months?

    b. After how many months will the loan be paid off?

    Answer
    a. The student owes \( $9383\) after \( 12\) months.
    b. The loan will be paid in full after \( 139\) months or eleven and a half years.

    62) [Technology Required] Consider a series combining geometric growth and arithmetic decrease. Let \( a_1=1\). Fix \( a>1\) and \( 0<b<a\). Set \( a_{n+1}=a.a_n−b.\) Find a formula for \( a_{n+1}\) in terms of \( a_n, a\), and \( b\) and a relationship between \( a\) and \( b\) such that \( a_n\) converges.

    63) [Technology Required] The binary representation \( x=0.b_1b_2b_3...\) of a number \( x\) between \( 0\) and \( 1\) can be defined as follows. Let \( b_1=0\) if \( x<1/2\) and \( b_1=1\) if \( 1/2 \leq x<1.\) Let \( x_1=2x−b_1\). Let \( b_2=0\) if \( x_1<1/2\) and \( b_2=1\) if \( 1/2 \leq x<1\). Let \( x_2=2x_1−b_2\) and in general, \( x_n=2x_{n−1}−b_n\) and \( b_{n−}1=0\) if \( x_n<1/2\) and \( b_{n−1}=1\) if \( 1/2 \leq x_n<1\). Find the binary expansion of \( 1/3\).

    Answer
    \( b_1=0, x_1=2/3, b_2=1, x_2=4/3−1=1/3,\) so the pattern repeats, and \( 1/3=0.010101 \ldots .\)

    64) [Technology Required] To find an approximation for \( \pi \), set \( a_0=\sqrt{2+1}, a_1=\sqrt{2+a_0}\), and, in general, \( a_{n+1}=\sqrt{2+a_n}\). Finally, set \( p_n=3.2^n\sqrt{2−a_n}\). Find the first ten terms of \( p_n\) and compare the values to \( \pi \).

    For the following two exercises, assume that you have access to a computer program or Internet source that can generate a list of zeros and ones of any desired length. Pseudo-random number generators (PRNGs) play an important role in simulating random noise in physical systems by creating sequences of zeros and ones that appear like the result of flipping a coin repeatedly. One of the simplest types of PRNGs recursively defines a random-looking sequence of \( N\) integers \( a_1,a_2, \ldots ,a_N\) by fixing two special integers \( (K\) and \( M\) and letting \( a_{n+1}\) be the remainder after dividing \( K.a_n\) into \( M\), then creates a bit sequence of zeros and ones whose \(n^{\text{th}}\) term \( b_n\) is equal to one if \( a_n\) is odd and equal to zero if \( a_n\) is even. If the bits \( b_n\) are pseudo-random, then the behavior of their average \( (b_1+b_2+ \cdots +b_N)/N\) should be similar to behavior of averages of truly randomly generated bits.

    65) [Technology Required] Starting with \( K=16,807\) and \( M=2,147,483,647\), using ten different starting values of \( a_1\), compute sequences of bits \( b_n\) up to \( n=1000,\) and compare their averages to ten such sequences generated by a random bit generator.

    Answer
    For the starting values \( a_1=1, a_2=2, \ldots , a_1=10,\) the corresponding bit averages calculated by the method indicated are \( 0.5220, 0.5000, 0.4960, 0.4870, 0.4860, 0.4680, 0.5130, 0.5210, 0.5040,\) and \( 0.4840\). Here is an example of ten corresponding averages of strings of \( 1000\) bits generated by a random number generator: \( 0.4880, 0.4870, 0.5150, 0.5490, 0.5130, 0.5180, 0.4860, 0.5030, 0.5050, 0.4980.\) There is no real pattern in either type of average. The random-number-generated averages range between \( 0.4860\) and \( 0.5490\), a range of \( 0.0630\), whereas the calculated PRNG bit averages range between \( 0.4680\) and \( 0.5220\), a range of \( 0.0540.\)

    66) [Technology Required] Find the first \( 1000\) digits of \( \pi \) using either a computer program or Internet resource. Create a bit sequence \( b_n\) by letting \( b_n=1\) if the \(n^{\text{th}}\) digit of \( \pi \) is odd and \( b_n=0\) if the \(n^{\text{th}}\) digit of \( \pi \) is even. Compute the average value of \( b_n\) and the average value of \( d_n=|b_{n+1}−b_n|, n=1,...,999.\) Does the sequence \( b_n\) appear random? Do the differences between successive elements of \( b_n\) appear random?


    This page titled 3.1E: Exercises is shared under a CC BY-NC-SA 4.0 license and was authored, remixed, and/or curated by Roy Simpson.

    • Was this article helpful?