Chapter 4: Problem 2
(a) Can a finite, nonempty set be inductive? Explain. (b) Is the empty set inductive? Explain.
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! 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}
Learning Materials
Features
Discover
Chapter 4: Problem 2
(a) Can a finite, nonempty set be inductive? Explain. (b) Is the empty set inductive? Explain.
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
The quadratic formula can be used to show that \(\alpha=\frac{1+\sqrt{5}}{2}\) and \(\beta=\frac{1-\sqrt{5}}{2}\) are the two real number solutions of the quadratic equation \(x^{2}-x-1=0\). Notice that this implies that $$ \begin{array}{l} \alpha^{2}=\alpha+1, \text { and } \\ \beta^{2}=\beta+1 \end{array} $$ It may be surprising to find out that these two irrational numbers are closely related to the Fibonacci numbers. (a) Verify that \(f_{1}=\frac{\alpha^{1}-\beta^{1}}{\alpha-\beta}\) and that \(f_{2}=\frac{\alpha^{2}-\beta^{2}}{\alpha-\beta}\). (b) (This part is optional, but it may help with the induction proof in part (c).) Work with the relation \(f_{3}=f_{2}+f_{1}\) and substitute the expressions for \(f_{1}\) and \(f_{2}\) from part (a). Rewrite the expression as a single fraction and then in the numerator use \(\alpha^{2}+\alpha=\alpha(\alpha+1)\) and a similar equation involving \(\beta .\) Now prove that \(f_{3}=\frac{\alpha^{3}-\beta^{3}}{\alpha-\beta}\).(c) Use induction to prove that for each natural number \(n,\) if \(\alpha=\frac{1+\sqrt{5}}{2}\) and \(\beta=\frac{1-\sqrt{5}}{2},\) then \(f_{n}=\frac{\alpha^{n}-\beta^{n}}{\alpha-\beta} .\) Note: This formula for the \(n^{t h}\) Fibonacci number is known as Binet's formula, named after the French mathematician Jacques Binet ( \(1786-1856\) ).
The Future Value of an Ordinary Annuity. For an ordinary annuity, \(R\) dollars is deposited in an account at the end of each compounding period. It is assumed that the interest rate, \(i,\) per compounding period for the account remains constant. Let \(S_{t}\) represent the amount in the account at the end of the \(t\) th compounding period. \(S_{t}\) is frequently called the future value of the ordinary annuity. So \(S_{1}=R\). To determine the amount after two months, we first note that the amount after one month will gain interest and grow to \((1+i) S_{1} .\) In addition, a new deposit of \(R\) dollars will be made at the end of the second month. So $$ S_{2}=R+(1+i) S_{1} $$ (a) For each \(n \in \mathbb{N},\) use a similar argument to determine a recurrence relation for \(S_{n+1}\) in terms of \(R, i,\) and \(S_{n}\). (b) By recognizing this as a recursion formula for a geometric series, use Proposition 4.16 to determine a formula for \(S_{n}\) in terms of \(R, i,\) and \(n\) that does not use a summation. Then show that this formula can be written as $$ S_{n}=R\left(\frac{(1+i)^{n}-1}{i}\right) $$ (c) What is the future value of an ordinary annuity in 20 years if \(\$ 200\) dollars is deposited in an account at the end of each month where the interest rate for the account is \(6 \%\) per year compounded monthly? What is the amount of interest that has accumulated in this account during the 20 years?
(a) Prove that if \(n \in \mathbb{N},\) then there exists an odd natural number \(m\) and a nonnegative integer \(k\) such that \(n=2^{k} m\). (b) For each \(n \in \mathbb{N}\), prove that there is only one way to write \(n\) in the form described in Part (a). To do this, assume that \(n=2^{k} m\) and \(n=2^{q} p\) where \(m\) and \(p\) are odd natural numbers and \(k\) and \(q\) are nonnegative integers. Then prove that \(k=q\) and \(m=p\).
Instead of using induction, we can sometimes use previously proven results about a summation to obtain results about a different summation. (a) Use the result in Progress Check 4.3 to prove the following proposition: For each natural number \(n, 3+6+9+\cdots+3 n=\frac{3 n(n+1)}{2}\) (b) Subtract \(n\) from each side of the equation in Part (a). On the left side of this equation, explain why this can be done by subtracting 1 from each term in the summation. (c) Algebraically simplify the right side of the equation in Part (b) to obtain a formula for the sum \(2+5+8+\cdots+(3 n-1)\). Compare this to Exercise (3a).
Use mathematical induction to prove that the sum of the cubes of any three consecutive natural numbers is a multiple of 9 .
What do you think about this solution?
We value your feedback to improve our textbook solutions.