A Pipe Yard's Square Layers: How Many Pipes a Stack Holds and How Tall It May Be
A pipe yard stacks pipes in square layers. The top layer is a single pipe, the layer below it is a 2 by 2 square of 4 pipes, and the kth layer from the top is a k by k square of k2 pipes. (a) How many pipes are in a stack of 12 layers? (b) The yard allows at most 1000 pipes in one stack. What is the greatest number of layers allowed, and how many of the 1000 does that stack leave unused?
The layers are the square numbers, so the total is the sum of the first n squares. That sum has a closed formula, n(n+1)(2n+1)6, and the formula does both parts: it gives the twelve-layer total at once, and it lets the yard's limit be tested layer by layer without adding anything up again.
- Count the pipes layer by layer. Layer 1 holds 1 pipe, layer 2 holds 22 = 4, layer 3 holds 32 = 9, and layer k holds k2. A stack of n layers therefore holds ∑k=1n k2 pipes, the sum of the first n square numbers.
- Use the closed formula rather than adding twelve terms: ∑k=1n k2 = n(n+1)(2n+1)6. With n = 12 the top is 12 × 13 × 25.
- (a) 12 × 13 × 256 = 39006 = 650 pipes. Check by adding the twelve layers one at a time: 1 + 4 + 9 + 16 + 25 + 36 + 49 + 64 + 81 + 100 + 121 + 144 = 650.
- For part (b) the formula is quicker than a table. With n = 13 the stack holds 13 × 14 × 276 = 819 pipes, which is inside the limit. With n = 14 it holds 14 × 15 × 296 = 1015 pipes, which is over it.
- (b) The greatest stack allowed is 13 layers. It holds 819 pipes, so it leaves 1000 − 819 = 181 pipes of the allowance unused. A fourteenth layer would need 142 = 196 more pipes, and only 181 are allowed.
answer(a) 650 pipes; (b) 13 layers, holding 819 pipes and leaving 181 of the 1000 unused
techniqueSums of Squares and Cubes
Common pitfalls
- Reaching for n(n+1)2, the formula for the sum of the first n whole numbers, because it is the one most often met. That adds 1 + 2 + … + 12 = 78, the pipes along one edge of each layer, not the pipes in the layers themselves. The square numbers have a formula of their own, n(n+1)(2n+1)6.
- Turning the limit into a division, such as 1000 ÷ 12, and rounding the result to a number of layers. The limit is on the total, so the test is whether the whole sum for a given n stays under 1000. Here n = 13 gives 819 and n = 14 gives 1015, so the answer is 13 and no rounding came into it.
A Valve That Seals Itself as It Leaks: A Total Whose Middle Terms All Cancel
A valve is sealing itself as its sealant swells, so it leaks less every hour. In hour k it loses 240k(k+1) milliliters. (a) How much has leaked after 15 hours? (b) The maintenance log is signed as soon as the total leak first rises above 230 mL. In which hour is it signed, and what is the most that can ever leak?
Adding fifteen fractions is possible but tells you nothing about the sixteenth hour. Writing each term as a difference of two neighboring fractions makes almost everything cancel, which gives the exact total after fifteen hours and, in the same line of working, the total after any number of hours at all.
- Split the term into partial fractions. Since 1k − 1k+1 = 1k(k+1), the loss in hour k is 240k(k+1) = 240(1k − 1k+1) milliliters.
- Write the fifteen hours out in that form: 240[(1 − 12) + (12 − 13) + … + (115 − 116)]. Every fraction after the first is subtracted once and added once, so the pairs cancel and only the two ends remain.
- (a) What is left is 240(1 − 116) = 240 × 1516 = 225 mL.
- The same canceling holds for any number of hours, so after n hours the total is 240(1 − 1n+1) mL. As n grows, 1n+1 tends to 0, so the total climbs to 240 mL without ever reaching it.
- (b) Solve 240(1 − 1n+1) > 230, which gives 1n+1 < 10240 = 124, so n + 1 > 24 and n = 24. Check: after 23 hours the total is 240 × 2324 = 230 mL exactly, which has not passed 230; after 24 hours it is 240 × 2425 = 230.4 mL. The log is signed in hour 24, and the leak can never pass 240 mL.
answer(a) 225 mL; (b) in hour 24, and the leak can never pass 240 mL
techniqueThe Method of Differences
Common pitfalls
- Adding the fifteen fractions on a calculator and giving the rounded decimal. The method of differences gives the exact figure, 225 mL, and it gives more besides: the same working produces the total after any number of hours, which is what part (b) needs.
- Reading "the total climbs to 240" as "the total reaches 240". It does not. After n hours the total is 240 − 240n+1, which is below 240 for every n; 240 mL is the value the totals close on, and the leak stays under it forever.
An Endowment Whose Yearly Grant Settles but Whose Total Does Not: The Year the Fund Runs Dry
A trust pays a grant every year. The grant in year n is 5nn+1 thousand dollars. The trustee argues that the grants settle at $5 thousand a year, so the total paid out settles as well and an endowment of $100 thousand will last forever. (a) Use the nth term test to show that the total paid out does not settle. (b) In which year does the total paid out first pass $100 thousand?
The trustee has run two different quantities together: the grant in a single year, which does settle, and the running total of all the grants, which is the sum of a series. The nth term test compares the terms with 0, and because they settle at 5 instead the series cannot converge. The year itself is then found by adding the grants until the running total passes the endowment.
- Work out what one year's grant approaches. Divide the top and the bottom by n: 5nn+1 = 51 + 1n. As n grows, 1n tends to 0, so the grant tends to $5 thousand a year.
- That is what the nth term test asks about. If ∑ an converges then an must tend to 0. Here an tends to 5, so the condition fails and the series of grants cannot converge.
- (a) The total paid out diverges. The yearly grant settles at $5 thousand, but the running total of the grants grows without bound, and paying out nearly $5 thousand every year forever exhausts an endowment of any size.
- For the year itself, add the grants one at a time. A rough guess is 100 ÷ 5 = 20 years, and the true answer is a little later because each grant is slightly under $5 thousand. The running totals are $86.8 thousand after 20 years, $96.3 thousand after 22 years and $101.1 thousand after 23 years.
- (b) The total paid out first passes $100 thousand in year 23. The endowment is exhausted then, not never, and the trustee's plan fails in its twenty-third year.
answer(a) The grants tend to $5 thousand rather than to 0, so by the nth term test the total paid out diverges; (b) year 23
techniqueThe nth Term Test for Divergence
Common pitfalls
- Taking "the grants tend to $5 thousand" as a reason the total tends to $5 thousand. The limit of the terms and the sum of the series are two different quantities: here the terms settle at 5 while the sum grows without bound.
- Reading the nth term test the other way round, as though terms tending to 0 would prove the total settles. The test can only rule a series out. The harmonic series ∑ 1n has terms tending to 0 and diverges all the same, so a limit of 0 decides nothing on its own.
Planks Stacked Over the Edge of a Bench: How Far the Top One Can Reach
A carpenter stacks identical planks 30 cm long on a bench, each one pushed out over the one below. With n planks the furthest the top plank's end can hang past the bench edge is 15(1 + 12 + 13 + … + 1n) cm. (a) How far past the edge can four planks reach? (b) Can the stack reach 1 m past the edge, and if so how many planks does that take?
The bracket is the harmonic series, the p-series with p = 1. A p-series converges when p > 1 and diverges when p ≤ 1, so this one diverges and the reach has no ceiling at all. The number of planks for a stated reach is then a matter of adding terms until the total is large enough, and the count is large because the harmonic series grows so slowly.
- (a) Put n = 4 into the bracket: 1 + 12 + 13 + 14 = 12 + 6 + 4 + 312 = 2512. The reach is 15 × 2512 = 37512 = 31.25 cm, which is already more than a whole plank's length past the edge.
- Now look at the bracket as a series. It is ∑ 1n, the p-series with p = 1, which diverges: its partial sums grow without bound even though the terms shrink to 0.
- Because the partial sums pass every number, some stack reaches 1 m. To find which, note that 1 m = 100 cm needs 1 + 12 + … + 1n = 10015 = 203 ≈ 6.667.
- Add the terms one at a time until the total passes 203. At 440 planks the reach is 99.98 cm, just short; at 441 planks it is 100.01 cm.
- (b) Yes, with 441 planks. The contrast is worth keeping in mind: if each plank added only 15k2 cm, the p-series with p = 2 would converge and the whole stack could never reach 15 × π26 ≈ 24.7 cm, however many planks were used.
answer(a) 31.25 cm; (b) yes, with 441 planks
techniqueThe p-Series · The nth Term Test for Divergence
Common pitfalls
- Deciding the stack must stop somewhere because the terms 1n shrink to 0. Terms shrinking to 0 are necessary for convergence but not enough for it, and the harmonic series is the standard example: its terms tend to 0 and its sum still grows without bound.
- Treating every series of the form ∑ 1np alike. The value of p decides the matter. With p = 1 the reach is unlimited, while with p = 2 the series converges and the reach could never pass 15 × π26 ≈ 24.7 cm.
Two Aerials and the Power in Their Harmonics: One Total Finite, the Other Not
The power radiated by the nth harmonic of an aerial is Pn = 2n+1n3+n microwatts. A second aerial of another design radiates Qn = 2n+1n2+n microwatts in its nth harmonic. (a) Show that the first aerial's total power over all its harmonics is finite, and give an upper bound for it. (b) The second aerial must be switched off once its total passes 10 microwatts. How many harmonics does that take?
Neither total can be added in closed form, and neither needs to be. The comparison test settles both: each term of the first series is below a term of a convergent p-series, and each term of the second is above a term of the harmonic series. Only the second question needs arithmetic, and then only adding terms until the total is large enough.
- Compare Pn with a simpler term. For every n ≥ 1, 2n + 1 ≤ 3n and n3 + n ≥ n3, so Pn = 2n+1n3+n ≤ 3nn3 = 3n2.
- The series ∑ 3n2 is three times the p-series with p = 2, which converges. By the comparison test a series of positive terms lying under the terms of a convergent series converges as well, so ∑ Pn converges.
- (a) The total power is finite, and it is at most 3 ∑ 1n2 = 3 × π26 = π22 ≈ 4.93 microwatts. Adding the first forty harmonics gives about 2.78 microwatts, comfortably inside that bound.
- Turn to the second aerial. Here n2 + n = n(n+1) and 2n + 1 = n + (n+1), so Qn = 1n+1 + 1n, which is larger than 1n. The harmonic series diverges, so by the comparison test ∑ Qn diverges and its total passes every number.
- (b) Add the terms until the total passes 10. The first is Q1 = 32 = 1.5 and the second is Q2 = 56, and the totals reach 9.99 microwatts after 136 harmonics and 10.01 microwatts after 137. The aerial is switched off after 137 harmonics.
answer(a) Finite: every Pn ≤ 3n2, so the total is at most π22 ≈ 4.93 microwatts; (b) 137 harmonics
techniqueComparison Tests for Series · The p-Series
Common pitfalls
- Comparing on the wrong side. To prove a series of positive terms converges, its terms must be bounded above by the terms of a convergent series, and to prove one diverges its terms must be bounded below by the terms of a divergent series. Showing that Pn ≥ 1n3 would prove nothing at all.
- Judging Qn to converge because it looks like Pn with a smaller power. The power on the bottom is exactly what decides it: 2n+1n3+n behaves like 2n2 and converges, while 2n+1n2+n behaves like 2n and diverges.
A Robot Arm's Alternating Corrections: Where It Settles and How Close It Is Already
A robot arm corrects its own position. On step n it moves (−1)n+112n millimeters along one axis, so it moves 12 mm one way, then 6 mm back, then 4 mm forward, and so on. (a) Show that the arm settles at a position, and give where it stands after four steps together with a bound on how far it still has to go. (b) How many steps guarantee that the arm is within 0.05 mm of where it settles?
The moves alternate in direction and shrink in size, which is what the alternating series test is for. The test does two jobs here: it says the arm settles, and it hands over an error bound that costs nothing to work out, since the error after any number of steps is at most the size of the next move.
- Check the alternating series test. The signs alternate; the sizes decrease, because 12n+1 < 12n for every n; and 12n tends to 0. All three conditions hold, so the series converges and the arm settles at a definite position.
- Add the first four moves: 12 − 6 + 4 − 3 = 7 mm. After four steps the arm stands 7 mm from where it started.
- For an alternating series that passes the test, the error after any number of terms is at most the size of the first term left out. Here that is the fifth move, 125 = 2.4 mm.
- (a) The arm settles, and after four steps it is at 7 mm with at most 2.4 mm still to go. Consecutive partial sums straddle the settled value: 7 mm is below it and 7 + 2.4 = 9.4 mm is above it, so the arm settles between 7 mm and 9.4 mm. The exact value is 12 ln 2 = 8.32 mm.
- (b) After n steps the bound is 12n+1 mm. Solve 12n+1 ≤ 0.05, which gives n + 1 ≥ 240 and n = 239 steps. Check: 12240 = 0.05 exactly, while 238 steps leave a bound of 12239 ≈ 0.0502 mm, which is more than 0.05.
answer(a) It settles; after four steps it stands at 7 mm, within 2.4 mm of the settled value, which lies between 7 mm and 9.4 mm and equals 12 ln 2 = 8.32 mm; (b) 239 steps
techniqueThe Alternating Series Test
Common pitfalls
- Using the alternating series test without checking that the sizes decrease. Alternating signs and terms tending to 0 are not enough between them; all three conditions are needed, and a series whose sizes rise and fall can fail the test even with the signs alternating perfectly.
- Adding more terms to sharpen an estimate but quoting the bound belonging to the old number of terms. The bound is the first term left out, so it changes with every extra term: after four steps it is 125 = 2.4 mm, and after 239 steps it is 12240 = 0.05 mm.
A Helpdesk's Busiest Minute: A Factorial on the Bottom and the Chance of Being Swamped
A helpdesk receives an average of 3 calls a minute. The chance of exactly n calls arriving in one minute is pn = 3nn!e−3. (a) Use the ratio test on ∑n=0∞ 3nn! to show that these chances add to a finite number, and say what that number must be. (b) The desk can answer at most 5 calls in a minute. What is the chance that it is swamped in a given minute?
A factorial is what the ratio test is best at: the ratio of one term to the one before cancels almost everything and leaves a simple expression in n. Here it leaves 3n+1, which tends to 0, so the series converges however large the average is. The ratio also shows how fast the terms die away, which is why so few of them are needed in part (b).
- Write the ratio of one term to the one before it: an+1an = 3n+1(n+1)! × n!3n = 3n+1, because (n+1)! = (n+1) × n! and every other factor cancels.
- Let n grow. Then 3n+1 → 0, and 0 < 1, so by the ratio test ∑ 3nn! converges. The same ratio says where the terms turn: it is above 1 at n = 0 and n = 1, equal to 1 at n = 2, and below 1 from n = 3 on, so the terms rise to a peak and then fall away quickly.
- (a) The chances add to a finite number. In fact ∑n=0∞ 3nn! = e3, so ∑ pn = e−3 × e3 = 1, which is what a complete list of chances has to add to.
- For part (b), being swamped means 6 or more calls, and it is shorter to find the chance of 5 or fewer and subtract. ∑n=05 3nn! = 1 + 3 + 4.5 + 4.5 + 3.375 + 2.025 = 18.4, so the chance of 5 or fewer calls is 18.4e−3 = 0.916.
- (b) The chance of being swamped is 1 − 0.916 = 0.084, about one minute in twelve.
answer(a) The ratio is 3n+1, whose limit is 0, so the series converges and the chances add to 1; (b) about 0.084, roughly one minute in twelve
techniqueThe Ratio Test
Common pitfalls
- Canceling the factorials wrongly and writing (n+1)!n! = n. It is n + 1, since (n+1)! = (n+1) × n!. The slip turns the ratio into 3n, which still tends to 0 here, but in a series where the verdict hangs on the limit it changes the answer.
- Answering with the chance of 5 or fewer calls. The desk is swamped when 6 or more arrive, so what is wanted is the complement, 1 − 0.916, and not the 0.916 itself.
A Spring Model Written as a Power Series: How Far It May Be Trusted
A laboratory models the energy stored in a spring stretched x cm as E(x) = ∑n=1∞ n xn4n joules, for a stretch of x centimeters. (a) Find the radius of convergence and the interval of x on which the series converges, with each end included or excluded as it falls. (b) Find the energy the model gives at an extension of 2 cm, and say what it gives at an extension of 5 cm.
A power series is trustworthy only inside its interval of convergence, so the first job is to find that interval: the ratio test gives the radius, and the two ends have to be tested separately because the ratio test says nothing there. Inside the interval the sum can be worked out; outside it there is no sum to quote.
- Apply the ratio test to the sizes of the terms: |an+1an| = (n+1)|x|n+14n+1 × 4nn|x|n = n+1n × |x|4, and n+1n → 1, so the limit is |x|4.
- The series converges while that limit is below 1, which is |x| < 4, so the radius of convergence is R = 4.
- Test the two ends, which the ratio test leaves undecided. At x = 4 the terms are n × 4n4n = n, which do not tend to 0. At x = −4, a compression of 4 cm, they are (−1)n n, which do not tend to 0 either. By the nth term test both ends diverge.
- (a) The radius is 4 and the interval of convergence is −4 < x < 4, with both ends excluded. The model says nothing at all about a stretch of 4 cm or more.
- (b) At x = 2 the series is ∑n=1∞ n(12)n, and ∑n=1∞ nrn = r(1−r)2 for |r| < 1, so the energy is 12(12)2 = 2 joules. At x = 5 the ratio is 54, which is above 1, so the terms grow without bound and the series diverges: the model gives nothing for a 5 cm extension, and a different model is needed there.
answer(a) R = 4, and the interval is −4 < x < 4 with both ends excluded; (b) 2 joules at 2 cm, and nothing at 5 cm, where the series diverges
techniqueRadius and Interval of Convergence · The Ratio Test · The nth Term Test for Divergence
Common pitfalls
- Stopping at the radius and writing the interval as −4 ≤ x ≤ 4. The ratio test is silent at the ends, so each one must be tested on its own; here both fail the nth term test and both are therefore excluded.
- Reading a divergent series as an energy of zero, or as an infinite energy. A divergent series has no sum, so the model makes no claim at 5 cm. That is a limit on the model, not a statement about the spring.
A Calculator's Sine Key: How Many Terms Six Decimal Places Need
A calculator works out sin 0.5, the angle being in radians, from the Maclaurin series sin x = x − x33! + x55! − …, and it must be right to 6 decimal places. (a) Work out the estimate from the first three terms, and use the Lagrange error bound to show that three terms are not enough. (b) How many terms are enough, and what is sin 0.5 to 6 decimal places?
The Maclaurin series for the sine is one of the standard five, so no derivatives need working out. What does need working out is how far a few terms can be from the true value, and the Lagrange bound answers that: every derivative of the sine is a sine or a cosine, so each is at most 1 in size and the bound is simply the next power over the next factorial.
- Take the first three terms at x = 0.5: 0.5 − 0.536 + 0.55120 = 0.5 − 0.0208333 + 0.0002604 = 0.4794271.
- Bound the error. For a Taylor polynomial of degree n the Lagrange bound is M|x|n+1(n+1)!, where M bounds the (n+1)th derivative. Every derivative of the sine is ±sin or ±cos, so M = 1 serves for all of them. Three terms reach degree 5, so the error is at most 0.566! = 0.015625720 ≈ 0.0000217.
- (a) Six decimal places need the error below half a unit in the sixth place, which is 0.0000005. The bound 0.0000217 is far above that, so three terms cannot be trusted to 6 places, and in fact they are wrong there: the true value is 0.4794255, so the three-term estimate is out by about 0.0000015.
- Try four terms, a polynomial of degree 7. The bound becomes 0.588! = 0.0039062540320 ≈ 0.000000097, which is below 0.0000005, so four terms are enough.
- (b) Four terms give 0.5 − 0.536 + 0.55120 − 0.575040 = 0.4794255, and sin 0.5 = 0.479426 to 6 decimal places.
answer(a) 0.4794271, with an error bound of 0.0000217, which is too large for 6 decimal places; (b) four terms, and sin 0.5 = 0.479426
techniqueThe Lagrange Error Bound · The Standard Maclaurin Series
Common pitfalls
- Reading "6 decimal places" as "an error below 0.000001". The sixth place is settled only when the error is below half a unit in it, which is 0.0000005; a bound of 0.0000009 would leave the sixth digit in doubt.
- Counting terms and degrees as the same number. Three terms of the sine series reach degree 5, not degree 3, because the even powers are missing. Putting n = 3 into the bound gives 0.544! ≈ 0.0026 and overstates the error by a factor of more than a hundred.
A Yogurt Incubator Read Away from Its Calibration Point: A Taylor Series About 20 Degrees
A dairy's controller knows a batch's setting time only at its calibration temperature of 20 degrees Celsius. The true setting time at T degrees is S(T) = 600T minutes for T between 18 and 30, and the controller stores only S(20) = 30 minutes, S'(20) = −1.5 minutes per degree and S''(20) = 0.15 minutes per degree squared. (a) Estimate the setting time at 23 degrees from the Taylor polynomial of degree 2 about 20 degrees. (b) Use the Lagrange error bound to say how far that estimate can be from the true time.
A Maclaurin series is a Taylor series about zero, and zero degrees is no use here: the controller's information sits at 20 degrees. The polynomial is therefore written in powers of T − 20, the step away from the calibration point, and the Lagrange bound uses the largest third derivative anywhere between the calibration point and the temperature being asked about.
- Write the Taylor polynomial of degree 2 about T = 20: S(T) ≈ S(20) + S'(20)(T − 20) + S''(20)2(T − 20)2. The center is 20, not 0, so every power is a power of T − 20.
- Put the stored numbers in, with 0.152 = 0.075: S(T) ≈ 30 − 1.5(T − 20) + 0.075(T − 20)2.
- (a) At T = 23 the step from the center is T − 20 = 3, so the estimate is 30 − 1.5 × 3 + 0.075 × 9 = 30 − 4.5 + 0.675 = 26.175 minutes.
- For the error, the Lagrange bound after the degree 2 term is M|T − 20|33!, where M bounds the third derivative between 20 and 23. Here S'''(T) = −3600T4, and 3600T4 is largest at the left end, so M = 3600204 = 3600160000 = 0.0225.
- (b) The bound is 0.0225 × 336 = 0.60756 = 0.101 minutes, about 6 seconds, so the estimate of 26.175 minutes is within 0.101 minutes of the truth. It is: the exact time is 60023 = 26.087 minutes, and the estimate is out by 0.088 minutes.
answer(a) About 26.175 minutes; (b) within 0.101 minutes, about 6 seconds, and the exact time is 60023 = 26.087 minutes, so the estimate is out by 0.088 minutes
techniqueTaylor Series About a Point · The Lagrange Error Bound
Common pitfalls
- Putting T = 23 into the powers instead of T − 20. The polynomial is written in the step away from the center, so the terms take 3: using 23 gives 30 − 34.5 + 39.675 = 35.175 minutes, which is nowhere near a setting time.
- Taking the third derivative at the center and stopping there. The Lagrange bound needs a value that holds right across the interval from the center to the point, so M is the largest 3600T4 for T between 20 and 23. Here that happens to be at T = 20, but for a point below the center it would be at the far end instead.