Sometimes the more basic an idea is, the harder it is to define it. It is also very hard to understand a definition in English when you are not a native speaker! We have had some interesting discussions of such issues recently with a student who asks very basic and yet very challenging questions of …
(A new question of the week) A recent question involved a word problem about fractions, which will fit in nicely with the current series on fractions. We’ll explore several ways to solve a rather tricky fraction word problem, some avoiding fractions as much as possible, some focusing on the meaning of the fractions, and others …
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’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 …
Last week’s exploration of a problem involving the Fibonacci sequence, has led me to delve into that and related concepts. In order to say much about the Fibonacci numbers, we have to first explore the concept of proof by mathematical induction. We’ll introduce it here, and then dig deeper next time.
Last week we looked at problems about counting diagonals in a polygon, and the very similar problem of counting handshakes when everyone in a group shakes with everyone else. In the course of searching for those problems, I also found some very different problems that are also about handshakes. We’ll look at those here, just …
(A new question of the week) Last week we looked at a recent question about an attempt to write a proof using the contrapositive, which was foiled by difficulty in negating a statement. Two weeks later, we had another question about the same sort of issue, but with a different problem in the negation. In …