(A new question of the week) We’ve looked at domain and range problems before, but some have more interesting details than others. Here is a superficially basic radical function (and the answer is extremely easy when you just use a graphing tool), which raised some interesting issues while solving it algebraically.
Last week we looked at several basic word problems for which the Fibonacci sequence is part of the solution. Now we’ll look at two problem that take longer to explain: a variation on the rabbit story, and an amazing reverse puzzle.
Here and next week, we’ll look at a collection of word problems we have seen that involve the Fibonacci sequence or its relatives, sometimes on the surface, other times only deep down. The first set (here) are direct representations of Fibonacci, while the second set will be considerably deeper. A 20-foot walkway The first, from …
Continuing our look at the Fibonacci sequence, we’ll extend the idea to “generalized Fibonacci sequences” (with different starting numbers), and see that the ratio of consecutive terms is the same in general as in the usual special case. Then we’ll look at the sum of terms of both the special and general sequence, turning it …
Having studied proof by induction and met the Fibonacci sequence, it’s time to do a few proofs of facts about the sequence. We’ll see three quite different kinds of facts, and five different proofs, most of them by induction. We’ll also see repeatedly that the statement of the problem may need correction or clarification, so …
We’re looking at the Fibonacci sequence, and have seen connections to a number called phi (φ or \(\phi\)), commonly called the Golden Ratio. I want to look at some geometrical connections and other interesting facts about this number before we get back to the Fibonacci numbers themselves and some inductive proofs involving them.
We’ve been examining inductive proof in preparation for the Fibonacci sequence, which is a playground for induction. Here we’ll introduce the sequence, and then prove the formula for the nth term using two different methods, using induction in a way we haven’t seen before.
Last week we looked at examples of induction proofs: some sums of series and a couple divisibility proofs. This time, I want to do a couple inequality proofs, and a couple more series, in part to show more of the variety of ways the details of an inductive proof can be handled.
Last week we looked at introductory explanations of what mathematical induction is, including answers to some misunderstandings of the concept. But we only looked at one trivial example of such a proof; for a real understanding of the technique, we need some fuller examples. For that purpose, I have chosen a few questions we have …
We’ve been looking at dissection puzzles, where we cut an object into pieces, and rearrange them. Here we’ll examine a mystery posed by two different puzzles, each of which seems to change the area by rearranging the pieces. The answer combines the marvelous Fibonacci numbers and [spoiler alert!] how easily we misjudge areas.