3.3.14 · D4Sequences & Series

Exercises — Binomial theorem for rational indices (approximate values)

2,852 words13 min readBack to topic
Figure — Binomial theorem for rational indices (approximate values)

What the figure shows (alt text). The thick navy curve is the true function (the honest square root) plotted for from to ; the horizontal axis is (the "small bit") and the vertical axis is the value of . Three dashed/dotted curves are the binomial approximations: the orange 1-term line , the magenta 2-term curve , and the violet 3-term curve . Notice two things the arrows point out: (i) near all four curves are glued together — so a couple of terms suffice when is tiny; (ii) as grows toward the convergence edge, the orange 1-term line peels away fastest while each extra term (magenta, then violet) clings to the navy curve longer. That is the entire pedagogical promise of this page: more terms = tighter fit, and small = fewer terms needed.


Level 1 — Recognition

Recall Solution

WHAT we do: use the coefficient formula with , . WHY: the coefficient of is exactly — three falling factors for .

=\frac{\tfrac12\cdot(-\tfrac12)\cdot(-\tfrac32)}{6}=\frac{\tfrac38}{6}=\frac{1}{16}.$$ Coefficient $=\dfrac{1}{16}$. (Matches the memorised series $(1+x)^{1/2}=1+\tfrac12x-\tfrac18x^2+\tfrac1{16}x^3-\cdots$.)
Recall Solution

WHAT we do: expand each candidate and look for a constant ratio between consecutive terms. WHY: a series is geometric precisely when every term is a fixed multiple of the one before. . Each term is the previous times , so it is a geometric series with common ratio . This is the same fact as from Infinite Geometric Series. The other two have coefficients or that are not a constant ratio, so they are not geometric.

Recall Solution

WHAT we do: identify the "small bit" inside the bracket (introduced in the top intuition callout) and impose the convergence rule on it. WHY: the series law only holds in the shape with the size of below . Here , so we need , i.e. . Outside this, terms grow and the sum is meaningless.


Level 2 — Application

Recall Solution

WHAT we do: rewrite the root as and plug , into the series to . WHY: is well under , so terms shrink by roughly each step; two corrections already pin down 4 decimals. True value — correct to 4 dp.

Recall Solution

WHAT we do: write the reciprocal root as a single power , then apply the series with , . WHY: a reciprocal and a root together are just one rational exponent — no need to expand twice. Coefficients: ; and , so the term is . True value

Recall Solution

WHAT we do: take , ; compute the first-order term , then size up the neglected term. WHY: with a large the second term can be non-negligible even for small , so we must check it rather than trust "one term is enough". (Note , so this series actually terminates after 11 terms and holds for all — we still keep only the leading terms because is tiny.) First order: . Next term , so a better estimate is . True value — the second term clearly mattered here because is large.


Level 3 — Analysis

Recall Solution

WHAT: factor out the nearest perfect cube. WHY: the series only lives in the shape, so we massage the number. , so . Here , comfortably under . Now expand with , . The second-order term is Error bound (why 3 dp is safe). This is an alternating, rapidly shrinking series. The first neglected term is the term . Its size is at most ; multiplied by the outside that is . So the truncation error in is below far smaller than the we need for 3 dp. Keeping the term is more than enough. Round to the requested 3 dp: . (Full value ; the 5-dp figure is shown only to display the intermediate accuracy, and it rounds correctly to .) ✓

Recall Solution

WHAT we do: expand to the term and compare against . WHY: the naive answer ignores the curvature; the sign of the term tells us which way the true value bends. Since , we get . The negative term is what pulls it just below the naive . (True: .)

Recall Solution

WHAT we do: read off the linear coefficient, then confirm it with the quadratic coefficient before trusting it. WHY: the linear term alone fixes (), but a single equation could mislead — the term is an independent check that we have the right . From the linear term: . Check with : ✓. So . Coefficient of : . So the next term is . (This is , whose signs alternate.)


Level 4 — Synthesis

Recall Solution

WHAT: expand each factor to , then multiply. WHY: a quotient of two near-1 numbers is a product of two near-1 series. Product . (True .) The corrections nearly cancel — a neat sanity check.

Recall Solution

WHAT we do: get once by the core coefficient law and once by differentiating the known GP, then compare. WHY: matching two independent routes is a proof that neither made a slip — and it shows the series behaves like the function under calculus. Way A (core law, derived not asserted): First expand with using the coefficient formula :

  • : .
  • : , coefficient .
  • : .
  • : .

So . Now set : since and , we get Way B (differentiate the GP): . Differentiate term by term: . Same first three terms ✓. This mirrors Maclaurin & Taylor Series where differentiating a known series is a legal shortcut.

Recall Solution

WHAT we do: split the square root into , expand each to , then multiply and collect. WHY: a ratio under a root becomes a product of two independent rational-index series, which we already know how to expand. . (from , : linear ; the term ). Multiply, keep up to : The cross term is what makes it work — don't drop it.


Level 5 — Mastery

Recall Solution

WHAT we do: apply the coefficient formula with and , then simplify the falling product into a clean pattern. WHY: we want a closed shape for the general term, not just the first few numbers, so we must track exactly how signs and factors of arise. For the coefficient of is . Here , and the falling factors are Step 1 — pull out the signs. Each of the factors is negative, so together they give a sign . Step 2 — pull out the halves. Each factor carries a denominator , so all of them contribute . Step 3 — what remains on top is the odd numbers . So the coefficient of is . Step 4 — put back . Then , contributing another . The two sign factors multiply: , so every coefficient is positive: For : .

Recall Solution

WHAT we do: compute the first dropped term and read its sign to decide the direction of the error. WHY: for an alternating, shrinking series the truncation error is essentially the first term you threw away — its sign tells you over vs under. First neglected term is with : . The true value equals (kept part) (this negative term) , so keeping only over-estimates by about . Indeed . This is exactly the "truncation error first dropped term" idea from Error & Approximation in Calculus.

Recall Solution

WHAT we do: substitute the endpoint values directly into the series and see whether the partial sums settle. WHY: convergence is decided at a point by the behaviour of the terms there, so testing the endpoints reveals whether the open interval can be widened. At the series becomes , which grows without bound — it diverges. The function at is undefined (division by zero) too, so the series honestly refuses to represent it there. The other endpoint . Here the series becomes , whose partial sums oscillate and never settle to a single value — so it also diverges (it does not converge, even though the function is perfectly finite there). This shows a series can fail to represent its function at an endpoint even when the function is well defined. General rational . Endpoints are delicate and depend on ; there is no single verdict. Three representative cases:

  • converges at both (giving ) and (giving ).
  • converges at but diverges at (the function itself blows up there).
  • (this problem) diverges at both endpoints, as shown above. The one statement that is always safe, for every rational , is the open interval ; the endpoints must be checked case by case (see Convergence of Series). Contrast this with , where the series is finite and converges for all with no endpoint worries at all.
Recall Solution

WHAT we do: list the successive terms and stop when the next one is below the tolerance. WHY: for this shrinking alternating series the first dropped term bounds the error, so its size is our stopping test. Terms: , , , . After keeping up to the term, the first dropped term is . So 3 terms (, , ) suffice. Estimate ; true , error ✓.


Connections

  • Binomial Theorem for Positive Integral Index — the terminating case these exercises generalise.
  • Maclaurin & Taylor Series — L4·2's "differentiate the series" trick lives here.
  • Infinite Geometric Series — L1·2 and L5·3 are pure GP facts in disguise.
  • Convergence of Series — the boundary explored in L5·3.
  • Error & Approximation in Calculus — truncation error, L5·2 and L5·4.