Calculus I · Patterns That Go Somewhere
Where this is heading
The word “approaches” is the hinge of everything that follows. In Chapter 2 we ask what a function approaches as its input closes in on a point — the same idea, lifted from lists to curves. In Chapter 3 we use it to do the thing this whole book is named for: take the slope of a straight line between two points on a curve and watch what it approaches as the points slide together. That limit is the slope of the curve itself — the derivative. Every limit you compute now is practice for that moment.
And , which appeared here as nothing more than the destination of a climbing list, will turn out to be one of the two or three most important numbers in all of mathematics. You met it first as a sequence. That’s fitting: in this book, the deep things arrive quietly, as patterns that go somewhere.
Problems
Six tiers, each with a different job. Fluency and Practice are doing* — drill until the moves are automatic, then multi-step work where you pick the tool. Concept & counterexample and ◆ Diamond are thinking — traps, constructions, and Layer-2 proofs that test whether you understand, not just compute. Teach it is teaching — explain, write up, or fix reasoning for a peer, which is the surest way to find the gaps in your own. Looking ahead hands you Chapter 2 early. Do all of Fluency; do not skip Concept or Teach it — that is where the understanding actually sets.*
Fluency — do these fast, until they’re automatic
- First four terms of: (a) ; (b) ; (c) ; (d) .
- Arithmetic, geometric, or neither — and give or where it applies: (a) ; (b) ; (c) ; (d) .
- Use a formula, not a list: (a) the th term of the arithmetic sequence with ; (b) the th term of the geometric sequence with .
- Guess the limit (or say “no limit”): (a) ; (b) ; (c) ; (d) ; (e) ; (f) .
- Divide by the highest power: (a) ; (b) ; (c) ; (d) .
- For each , does , , blow up, or oscillate? ; ; ; ; .
Practice — choose the right tool
- .
- An that hides a finite answer: . (Rationalize, then divide by the top power.)
- An : . (Mirror Fight one from the chapter exactly.)
- The -family: (a) ; (b) ; (c) .
- Use the gauge “ limit ”: evaluate or classify , , and . State first each time.
- A self-defined sequence: , . Compute , then find the limit by letting satisfy the rule. (You’ll prove it converges in the Diamond tier.)
- A geometric sequence has . About how many terms until it drops below ? (Use the idea behind the proof, or trial and error.)
- Decompose, then take the limit: . (Split into two pieces, one obvious, one you’ve already handled.)
Concept & counterexample — think; almost no arithmetic. State true/false and justify, or build the example asked for.
- If , then every term is within of . (b) If a sequence is bounded, it converges. (c) If , the sequence is eventually decreasing. (d) A sequence can converge to two different limits.
- Construct a bounded sequence that does not converge.
- Construct an increasing sequence that does not converge — and explain in one line which hypothesis of the Monotone Convergence principle your example is missing.
- Construct a sequence that converges to but whose terms are sometimes above and sometimes below .
- Find the error. A student writes: “ gets arbitrarily close to infinitely often and to infinitely often, so it has two limits, and .” Identify precisely what’s wrong, and state what is true.
- Is it possible? A sequence with whose running totals nonetheless grow without bound. (Name an example if yes — this is a quiet preview of infinite series.)
- The Monotone Convergence principle needs two hypotheses, “increasing” and “bounded above.” Give one sequence showing the conclusion fails if you drop “bounded above,” and one showing it fails if you drop “increasing.” (This proves both hypotheses are load-bearing.)
◆ Diamond — Layer 2: prove it
- ◆ Prove from the – definition.
- ◆ Prove from the definition.
- ◆ Prove from the definition. (First show .)
- ◆ Prove from the definition.
- ◆ Suppose . Using the limit laws, find , naming the law at each step.
- ◆ Prove via the Squeeze Theorem: name the two walls, cite the theorem, and explain in one sentence why never needed a limit of its own.
- ◆ Prove the uniqueness of limits: a sequence cannot converge to two different values . (Hint: if it did, take and derive a contradiction — a term can’t be within of both.) Connect this to your answer in 15(d).
- ◆ For the sequence in problem 12, prove it is increasing and bounded above by , completing the argument that it converges.
- ◆ Prove Bernoulli’s inequality for , , by induction.
- ◆◆ Prove for every . Steps: expand by the binomial theorem; bound the -th term by ; bound ; sum the geometric bound to get below .
- ◆◆ Adapt the proof to show . (Factor out the dominant , then squeeze.)
Teach it — the surest test of mastery is explaining it
- A friend has only ever heard “a limit is what a sequence gets closer and closer to.” In three or four sentences written to them, explain why that phrasing is unsafe, using a single concrete sequence that “gets closer” for a while but does not converge.
- Write a complete, textbook-quality worked solution to , narrating each step in words a classmate could follow without you in the room.
- Debug your classmate. They argue: “, because and to any power is .” Pinpoint the exact flawed step and write the one-sentence correction. (Name the indeterminate form they walked into.)
- Design a problem. Invent a self-defined sequence whose limit is exactly . State the you need, then write the four-step solution key (bounded, increasing, converges, solve for ) as if for a teacher’s answer book.
- In two or three sentences, teach the difference between “bounded” and “convergent.” Give one sequence that is bounded but not convergent, and say in plain words why one property does not imply the other.
Looking ahead — Chapter 2 in your hands early
- In Chapter 2 the input switches from a whole number to a real number sliding toward a point. Predict the value of by canceling the common factor, exactly as you’d simplify a sequence ratio. (Next chapter makes this rigorous — and explains why the cancel is legal.)
- You met as . Locate it from the other direction: with a calculator, compute and for small (say ). One is below , one above. Between which two whole-number bases must the “slope ” base — which Chapter 5 will reveal is — lie?
- Your recursive sequences found their limit by demanding — a fixed point. In Chapter 8 you’ll iterate to hunt a root. Predict: if that iteration settles to a value , what equation must satisfy?
Questions to talk about
No answer key. These are for arguing over, with someone who read the same chapter.
- 1, 1/2, 1/3, 1/4 … creeps toward zero without ever arriving. Why is 'never arrives' not the same as 'does not get there'? Try saying precisely what the list is doing.
- The chapter says the part that separates people who know about limits from people who can use them is knowing what to do when the obvious move fails. Where else is that the real dividing line?
- A recursive sequence finds its limit by demanding L equals the rule applied to L — a fixed point. What is appealing about defining an answer as the thing that does not change when you act on it?