2.S: Sequences (Summary)
 Page ID
 14759
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{\!\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\( \def\d{\displaystyle}\)
\( \newcommand{\f}[1]{\mathfrak #1}\)
\( \newcommand{\s}[1]{\mathscr #1}\)
\( \def\N{\mathbb N}\)
\( \def\B{\mathbf{B}}\)
\( \def\circleA{(.5,0) circle (1)}\)
\( \def\Z{\mathbb Z}\)
\( \def\circleAlabel{(1.5,.6) node[above]{$A$}}\)
\( \def\Q{\mathbb Q}\)
\( \def\circleB{(.5,0) circle (1)}\)
\( \def\R{\mathbb R}\)
\( \def\circleBlabel{(1.5,.6) node[above]{$B$}}\)
\( \def\C{\mathbb C}\)
\( \def\circleC{(0,1) circle (1)}\)
\( \def\F{\mathbb F}\)
\( \def\circleClabel{(.5,2) node[right]{$C$}}\)
\( \def\A{\mathbb A}\)
\( \def\twosetbox{(2,1.5) rectangle (2,1.5)}\)
\( \def\X{\mathbb X}\)
\( \def\threesetbox{(2,2.5) rectangle (2,1.5)}\)
\( \def\E{\mathbb E}\)
\( \def\O{\mathbb O}\)
\( \def\U{\mathcal U}\)
\( \def\pow{\mathcal P}\)
\( \def\inv{^{1}}\)
\( \def\nrml{\triangleleft}\)
\( \def\st{:}\)
\( \def\~{\widetilde}\)
\( \def\rem{\mathcal R}\)
\( \def\sigalg{$\sigma$algebra }\)
\( \def\Gal{\mbox{Gal}}\)
\( \def\iff{\leftrightarrow}\)
\( \def\Iff{\Leftrightarrow}\)
\( \def\land{\wedge}\)
\( \def\And{\bigwedge}\)
\( \def\entry{\entry}\)
\( \def\AAnd{\d\bigwedge\mkern18mu\bigwedge}\)
\( \def\Vee{\bigvee}\)
\( \def\VVee{\d\Vee\mkern18mu\Vee}\)
\( \def\imp{\rightarrow}\)
\( \def\Imp{\Rightarrow}\)
\( \def\Fi{\Leftarrow}\)
\( \def\var{\mbox{var}}\)
\( \def\Th{\mbox{Th}}\)
\( \def\entry{\entry}\)
\( \def\sat{\mbox{Sat}}\)
\( \def\con{\mbox{Con}}\)
\( \def\iffmodels{\bmodels\models}\)
\( \def\dbland{\bigwedge \!\!\bigwedge}\)
\( \def\dom{\mbox{dom}}\)
\( \def\rng{\mbox{range}}\)
\( \def\isom{\cong}\)
\(\DeclareMathOperator{\wgt}{wgt}\)
\( \newcommand{\vtx}[2]{node[fill,circle,inner sep=0pt, minimum size=4pt,label=#1:#2]{}}\)
\( \newcommand{\va}[1]{\vtx{above}{#1}}\)
\( \newcommand{\vb}[1]{\vtx{below}{#1}}\)
\( \newcommand{\vr}[1]{\vtx{right}{#1}}\)
\( \newcommand{\vl}[1]{\vtx{left}{#1}}\)
\( \renewcommand{\v}{\vtx{above}{}}\)
\( \def\circleA{(.5,0) circle (1)}\)
\( \def\circleAlabel{(1.5,.6) node[above]{$A$}}\)
\( \def\circleB{(.5,0) circle (1)}\)
\( \def\circleBlabel{(1.5,.6) node[above]{$B$}}\)
\( \def\circleC{(0,1) circle (1)}\)
\( \def\circleClabel{(.5,2) node[right]{$C$}}\)
\( \def\twosetbox{(2,1.4) rectangle (2,1.4)}\)
\( \def\threesetbox{(2.5,2.4) rectangle (2.5,1.4)}\)
\( \def\ansfilename{practiceanswers}\)
\( \def\shadowprops
Callstack: at (Template:MathJaxLevin), /content/body/div/p[1]/span, line 1, column 11 at template() at (Bookshelves/Combinatorics_and_Discrete_Mathematics/Book:_Discrete_Mathematics_(Levin)/2:_Sequences/2.S:__Sequences_(Summary)), /content/body/p[1]/span, line 1, column 22
\( \renewcommand{\bar}{\overline}\)
\( \newcommand{\card}[1]{\left #1 \right}\)
\( \newcommand{\twoline}[2]{\begin{pmatrix}#1 \\ #2 \end{pmatrix}}\)
\( \newcommand{\lt}{<}\)
\( \newcommand{\gt}{>}\)
\( \newcommand{\amp}{&}\)
\( \newcommand{\hexbox}[3]{
\def\x{cos{30}*\r*#1+cos{30}*#2*\r*2}
\def\y{\r*#1sin{30}*\r*#1}
\draw (\x,\y) +(90:\r)  +(30:\r)  +(30:\r)  +(90:\r)  +(150:\r)  +(150:\r)  cycle;
\draw (\x,\y) node{#3};
}\)
\(\renewcommand{\bar}{\overline}\)
\(\newcommand{\card}[1]{\left #1 \right}\)
\(\newcommand{\twoline}[2]{\begin{pmatrix}#1 \\ #2 \end{pmatrix}}\)
\(\newcommand{\lt}{<}\)
\(\newcommand{\gt}{>;}\)
\(\newcommand{\amp}{&}\)
Investigate!
Each day your supply of magic chocolate covered espresso beans doubles (each one splits in half), but then you eat 5 of them. You have 10 at the start of day 0.
 Write out the first few terms of the sequence. Then give a recursive definition for the sequence and explain how you know it is correct.
 Prove, using induction, that the last digit of the number of beans you have on the \(n\)th day is always a 5 for all \(n \ge 1\text{.}\)
 Find a closed formula for the \(n\)th term of the sequence and prove it is correct by induction.
In this chapter we explored sequences and mathematical induction. At first these might not seem entirely related, but there is a link: recursive reasoning. When we have many cases (maybe infinitely many), it is often easier to describe a particular case by saying how it relates to other cases, instead of describing it absolutely. For sequences, we can describe the \(n\)th term in the sequence by saying how it is related to the previous term. When showing a statement involving the variable \(n\) is true for all values of \(n\text{,}\) we can describe why the case for \(n = k\) is true on the basis of why the case for \(n = k1\) is true.
While thinking of problems recursively is often easer than thinking of them absolutely (at least after you get used to thinking in this way), our ultimate goal is to move beyond this recursive description. For sequences, we want to find closed formulas for the \(n\)th term of the sequence. For proofs, we want to know the statement is actually true for a particular \(n\) (not only under the assumption that the statement is true for the previous value of \(n\)). In this chapter we saw some methods for moving from recursive descriptions to absolute descriptions.
 If the terms of a sequence increase by a constant difference or constant ratio (these are both recursive descriptions), then the sequences are arithmetic or geometric, respectively, and we have closed formulas for each of these based on the initial terms and common difference or ratio.
 If the terms of a sequence increase at a polynomial rate (that is, if the differences between terms form a sequence with a polynomial closed formula), then the sequence is itself given by a polynomial closed formula (of degree one more than the sequence of differences).
 If the terms of a sequence increase at an exponential rate, then we expect the closed formula for the sequence to be exponential. These sequences often have relatively nice recursive formulas, and the characteristic root technique allows us to find the closed formula for these sequences.
 If we want to prove that a statement is true for all values of \(n\) (greater than some first small value), and we can describe why the statement being true for \(n = k\) implies the statement is true for \(n = k+1\text{,}\) then the principle of mathematical induction gives us that the statement is true for all values of \(n\) (greater than the base case).
Throughout the chapter we tried to understand why these facts listed above are true. In part, that is what proofs, by induction or not, attempt to accomplish: they explain why mathematical truths are in fact truths. As we develop our ability to reason about mathematics, it is a good idea to make sure that the methods of our reasoning are sound. The branch of mathematics that deals with deciding whether reasoning is good or not is mathematical logic, the subject of the next chapter.
Chapter Review
1
Find \(3 + 7 + 11+ \cdots + 427\text{.}\)
 Answer

\(\frac{430\cdot 107}{2} = 23005\text{.}\)
2
Consider the sequence \(2, 6, 10, 14, \ldots, 4n + 6\text{.}\)
 How many terms are there in the sequence?
 What is the secondtolast term?
 Find the sum of all the terms in the sequence.
 Answer

 \(n+2\) terms.
 \(4n+2\text{.}\)
 \(\frac{(4n+8)(n+2)}{2}\text{.}\)
3
Consider the sequence given by \(a_n = 2\cdot 5^{n1}\text{.}\)
 Find the first 4 terms of the sequence. What sort of sequence is this?
 Find the sum of the first 25 terms. That is, compute \(\d\sum_{k=1}^{25}a_k\text{.}\)
 Answer

 \(2, 10, 50, 250, \ldots\) The sequence is geometric.
 \(\frac{2  2\cdot 5^{25}}{4}\text{.}\)
4
Consider the sequence \(5, 11, 19, 29, 41, 55,\ldots\text{.}\) Assume \(a_1 = 5\text{.}\)
 Find a closed formula for \(a_n\text{,}\) the \(n\)th term of the sequence, by writing each term as a sum of a sequence. Hint: first find \(a_0\text{,}\) but ignore it when collapsing the sum.
 Find a closed formula again, this time using either polynomial fitting or the characteristic root technique (whichever is appropriate). Show your work.
 Find a closed formula once again, this time by recognizing the sequence as a modification to some well known sequence(s). Explain.
5
Use polynomial fitting to find a closed formula for the sequence \((a_n)_{n\ge 1}\text{:}\)
\begin{equation*} 4, 11, 20, 31, 44, \ldots. \end{equation*}
 Answer

\(a_n = n^2 + 4n  1\text{.}\)
6
Suppose the closed formula for a particular sequence is a degree 3 polynomial. What can you say about the closed formula for:
 The sequence of partial sums.
 The sequence of second differences.
 Answer

 The sequence of partial sums will be a degree 4 polynomial (its sequence of differences will be the original sequence).
 The sequence of second differences will be a degree 1 polynomial  an arithmetic sequence.
7
Consider the sequence given recursively by \(a_1 = 4\text{,}\) \(a_2 = 6\) and \(a_n = a_{n1} + a_{n2}\text{.}\)
 Write out the first 6 terms of the sequence.
 Could the closed formula for \(a_n\) be a polynomial? Explain.
 Answer

 \(4, 6, 10, 16, 26, 42, \ldots\text{.}\)
 No, taking differences gives the original sequence back, so the differences will never be constant.
8
The sequence \(1, 0, 2, 5, 9, 14\ldots\) has closed formula \(a_n = \dfrac{(n+1)(n2)}{2}\text{.}\) Use this fact to find a closed formula for the sequence \(4, 10, 18, 28, 40, \ldots\text{.}\)
 Answer

\(b_n = (n+3)n\text{.}\)
9
The in song The Twelve Days of Christmas, my true love gave to me first 1 gift, then 2 gifts and 1 gift, then 3 gifts, 2 gifts and 1 gift, and so on. How many gifts did my true love give me all together during the twelve days?
10
Consider the recurrence relation \(a_n = 3a_{n1} + 10 a_{n2}\) with first two terms \(a_0 = 1\) and \(a_1 = 2\text{.}\)
 Write out the first 5 terms of the sequence defined by this recurrence relation.
 Solve the recurrence relation. That is, find a closed formula for \(a_n\text{.}\)
 Answer

 \(1, 2, 16,68, 364, \ldots\text{.}\)
 \(a_n = \frac{3}{7}(2)^n + \frac{4}{7}5^n\text{.}\)
11
Consider the recurrence relation \(a_n = 2a_{n1} + 8a_{n2}\text{,}\) with initial terms \(a_0 = 1\) and \(a_1= 3\text{.}\)
 Find the next two terms of the sequence (\(a_2\) and \(a_3\)).
 Solve the recurrence relation. That is, find a closed formula for the \(n\)th term of the sequence.
 Answer

 \(a_2 = 14\text{.}\) \(a_3 = 52\text{.}\)
 \(a_n = \frac{1}{6}(2)^n + \frac{5}{6}4^n\text{.}\)
12
Your magic chocolate bunnies reproduce like rabbits: every large bunny produces 2 new mini bunnies each day, and each day every mini bunny born the previous day grows into a large bunny. Assume you start with 2 mini bunnies and no bunny ever dies (or gets eaten).
 Write out the first few terms of the sequence.
 Give a recursive definition of the sequence and explain why it is correct.
 Find a closed formula for the \(n\)th term of the sequence.
 Answer


On the first day, your 2 mini bunnies become 2 large bunnies. On day 2, your two large bunnies produce 4 mini bunnies. On day 3, you have 4 mini bunnies (produced by your 2 large bunnies) plus 6 large bunnies (your original 2 plus the 4 newly matured bunnies). On day 4, you will have \(12\) mini bunnies (2 for each of the 6 large bunnies) plus 10 large bunnies (your previous 6 plus the 4 newly matured). The sequence of total bunnies is \(2, 2, 6, 10, 22, 42\ldots\) starting with \(a_0 = 2\) and \(a_1 = 2\text{.}\)

\(a_n = a_{n1} + 2a_{n2}\text{.}\) This is because the number of bunnies is equal to the number of bunnies you had the previous day (both mini and large) plus 2 times the number you had the day before that (since all bunnies you had 2 days ago are now large and producing 2 new bunnies each).

Using the characteristic root technique, we find \(a_n = a2^n + b(1)^n\text{,}\) and we can find \(a\) and \(b\) to give \(a_n = \frac{4}{3}2^n + \frac{2}{3}(1)^n\text{.}\)

13
Prove the following statements by mathematical induction:
 \(n! \lt n^n\) for \(n \ge 2\)
 \(\d\frac{1}{1\cdot 2} + \frac{1}{2\cdot 3} +\frac{1}{3\cdot 4}+\cdots + \frac{1}{n\cdot(n+1)} = \d\frac{n}{n+1}\) for all \(n \in \Z^+\text{.}\)
 \(4^n  1\) is a multiple of 3 for all \(n \in \N\text{.}\)
 The greatest amount of postage you cannot make exactly using 4 and 9 cent stamps is 23 cents.
 Every even number squared is divisible by 4.
 Answer

 Hint: \((n+1)^{n+1} > (n+1) \cdot n^{n}\text{.}\)
 Hint: This should be similar to the other sum proofs. The last bit comes down to adding fractions.
 Hint: Write \(4^{k+1}  1 = 4\cdot 4^k  4 + 3\text{.}\)
 Hint: one 9cent stamp is 1 more than two 4cent stamps, and seven 4cent stamps is 1 more than three 9cent stamps.
 Careful to actually use induction here. The base case: \(2^2 = 4\text{.}\) The inductive case: assume \((2n)^2\) is divisible by 4 and consider \((2n+2)^2 = (2n)^2 + 4n + 4\text{.}\) This is divisible by 4 because \(4n +4\) clearly is, and by our inductive hypothesis, so is \((2n)^2\text{.}\)
14
Prove \(1^3 + 2^3 + 3^3 + \cdots + n^3 = \left(\frac{n(n+1)}{2}\right)^2\) holds for all \(n \ge 1\text{,}\) by mathematical induction.
 Hin

This is a straight forward induction proof. Note you will need to simplify \(\left(\frac{n(n+1)}{2}\right)^2 + (n+1)^3\) and get \(\left(\frac{(n+1)(n+2)}{2}\right)^2\text{.}\)
15
Suppose \(a_0 = 1\text{,}\) \(a_1 = 1\) and \(a_n = 3a_{n1}  2a_{n1}\text{.}\) Prove, using strong induction, that \(a_n = 1\) for all \(n\text{.}\)
 Hint

There are two base cases \(P(0)\) and \(P(1)\text{.}\) Then, for the inductive case, assume \(P(k)\) is true for all \(k \lt n\text{.}\) This allows you to assume \(a_{n1} = 1\) and \(a_{n2} = 1\text{.}\) Apply the recurrence relation.
16
Prove, using strong induction, that every positive integer can be written as the sum of distinct powers of 2. For example, \(13 = 1 + 4 + 8 = 2^0 + 2^2 + 2^3\text{.}\)
 Answer

Note that \(1 = 2^0\text{;}\) this is your base case. Now suppose \(k\) can be written as the sum of distinct powers of 2 for all \(1\le k \le n\text{.}\) We can then write \(n\) as the sum of distinct powers of 2 as follows: subtract the largest power of 2 less than \(n\) from \(n\text{.}\) That is, write \(n = 2^j + k\) for the largest possible \(j\text{.}\) But \(k\) is now less than \(n\text{,}\) and also less than \(2^j\text{,}\) so write \(k\) as the sum of distinct powers of 2 (we can do so by the inductive hypothesis). Thus \(n\) can be written as the sum of distinct powers of 2 for all \(n \ge 1\text{.}\)
17
Prove using induction that every set containing \(n\) elements has \(2^n\) different subsets for any \(n \ge 1\text{.}\)
 Answer

Let \(P(n)\) be the statement, “every set containing \(n\) elements has \(2^n\) different subsets.” We will show \(P(n)\) is true for all \(n \ge 1\text{.}\) Base case: Any set with 1 element \(\{a\}\) has exactly 2 subsets: the empty set and the set itself. Thus the number of subsets is \(2= 2^1\text{.}\) Thus \(P(1)\) is true. Inductive case: Suppose \(P(k)\) is true for some arbitrary \(k \ge 1\text{.}\) Thus every set containing exactly \(k\) elements has \(2^k\) different subsets. Now consider a set containing \(k+1\) elements: \(A = \{a_1, a_2, \ldots, a_k, a_{k+1}\}\text{.}\) Any subset of \(A\) must either contain \(a_{k+1}\) or not. In other words, a subset of \(A\) is just a subset of \(\{a_1, a_2,\ldots, a_k\}\) with or without \(a_{k+1}\text{.}\) Thus there are \(2^k\) subsets of \(A\) which contain \(a_{k+1}\) and another \(2^{k+1}\) subsets of \(A\) which do not contain \(a^{k+1}\text{.}\) This gives a total of \(2^k + 2^k = 2\cdot 2^k = 2^{k+1}\) subsets of \(A\text{.}\) But our choice of \(A\) was arbitrary, so this works for any subset containing \(k+1\) elements, so \(P(k+1)\) is true. Therefore, by the principle of mathematical induction, \(P(n)\) is true for all \(n \ge 1\text{.}\)