📝 Binomial series expansion (35 MCQs)

📖 Explanation: This question targets error analysis and conceptual understanding. The core misconception is treating negative exponents like positive integers. For $m = -2$, the generalized binomial coefficient $\binom{-2}{k}$ involves a product of negative integers that never equals zero. Thus, the series is infinite. Furthermore, unlike positive integer powers which converge everywhere, this series represents the function only within the radius of convergence $|x|<1$. Understanding this distinction is crucial for applying the binomial series correctly in calculus.

📖 Explanation: This application question compares two distinct error-checking methods. For $\sqrt{1+x} = (1+x)^{1/2}$, the binomial expansion yields an alternating series for $x>0$. The Alternating Series Estimation Theorem states the error is bounded by the absolute value of the next term. This is often computationally simpler than the Lagrange form $R_n(x)$, which requires maximizing $|f^{(n+1)}(z)|$. Recognizing when a binomial series is alternating allows for efficient, rigorous error analysis without complex derivative optimization.

📖 Explanation: This scenario-based question links mathematical series to physical modeling. The binomial expansion of $(1-u)^{-1/2}$ is $1 + u/2 + 3u^2/8 + \dots$ where $u=v^2/c^2$. Since $v \ll c$ in classical mechanics, $u$ is extremely small. Higher-order terms scale as $u^2, u^3$, etc., decaying rapidly. Truncating yields $K \approx mc^2(u/2) = \frac{1}{2}mv^2$, recovering Newtonian physics. This demonstrates how convergence rates justify model simplification in applied mathematics.

📖 Explanation: This graph/conceptual question addresses uniform vs. pointwise convergence. While the geometric series $\sum (-x)^n$ converges to $1/(1+x)$ for $|x|<1$, the function blows up at $x=-1$. Polynomials are continuous and bounded on closed intervals; they cannot mimic a vertical asymptote. Consequently, near the singularity, an arbitrarily high degree is needed for a fixed accuracy. This illustrates the limitation of power series representations near singularities and explains visual artifacts in graphing utilities.

📖 Explanation: This direct recall/conceptual question clarifies a critical bifurcation in the theory. When $m$ is a non-negative integer, $\binom{m}{k}=0$ for $k>m$, terminating the series and granting infinite radius of convergence. For any other real $m$, the coefficients never vanish, producing an infinite power series with radius $R=1$. Confusing these cases leads to incorrect domain assumptions in integration and differential equations. Mastery requires distinguishing the algebraic termination from analytic convergence.

📖 Explanation: This multi-step reasoning question connects integration, series, and function definition. Integrating $\sum \binom{-1/2}{k}(-x^2)^k$ yields a series plus $C$. Since $\arcsin(0)=0$, we must have $C=0$. Additionally, while the original series converges for $|x|<1$, the integrated series may converge at endpoints $\pm 1$. Confirming $C=0$ anchors the series to the specific function branch. Without this, the series could represent $\arcsin(x) + C$, failing to model the intended mathematical object accurately.

📖 Explanation: This comparative analysis question evaluates practical numerical strategy. Both series are valid: $(1+0.1)^{1/2}$ uses $x=0.1$ in the standard binomial form, while Taylor at 1 uses $(x-1)=0.1$. They are essentially the same series shifted. However, the binomial form $\sum \binom{1/2}{k}(0.1)^k$ is computationally streamlined via recursive coefficient formulas. The key insight is recognizing that 'small x' drives convergence speed. If evaluating $\sqrt{3}$, neither is optimal; one would center at 4 or use $\sqrt{3}=\sqrt{4(1-0.25)}$.

📖 Explanation: This error analysis question tests the boundary between function domains and series convergence domains. A function may be smooth and continuous everywhere (like $\sqrt[3]{1+x}$), yet its Maclaurin series has a finite radius of convergence determined by singularities in the complex plane (here, branch point at $x=-1$). At $x=2$, $|x|>R=1$, so the series diverges regardless of the function's behavior. Students must distinguish analytic continuation from power series representation validity.

📖 Explanation: This challenging question bridges calculus and combinatorics. Direct differentiation of $(1-x)^{-3}$ is tedious. Using the negative binomial identity $\binom{-n}{k} = (-1)^k \binom{n+k-1}{k}$ transforms the problem into counting combinations with repetition. For $n=3$, coeff is $(-1)^k (-1)^k \binom{k+2}{k} = \binom{k+2}{2}$. This reveals the deep connection between Taylor coefficients and combinatorial structures. Option C is algebraically correct but not simplified to the elegant combinatorial form requested. Recognizing these patterns accelerates series manipulation in advanced problems.

📖 Explanation: This mixed-concept question integrates series expansion with physical interpretation. Expanding $(1+u)^{-2} \approx 1 - 2u + 3u^2$ with $u=\epsilon \sin\theta$ yields $1 - 2\epsilon\sin\theta + 3\epsilon^2\sin^2\theta$. Treating $\sin\theta$ as constant ignores that $u$ itself varies with $\theta$. The resulting truncated series must preserve functional dependence. Losing $\sin\theta$ terms destroys the directional information essential in fields like electromagnetism or fluid dynamics. Correct perturbation theory requires carrying the variable through every order of expansion.

📖 Explanation: This conceptual question probes endpoint behavior. For $m=-1$, series is $\sum (-1)^k (-1)^k = \sum 1$, diverging. For $m=-2$, terms grow linearly. Even if $f(-1)$ exists (e.g., $m=-2$ gives $\infty$, but consider limits), the series representation breaks down. The divergence at $x=-1$ for $m \leq -1$ corresponds to the function's blow-up or insufficient decay rate. Contrast with $m>0$ where series converges absolutely at endpoints. This highlights that series convergence is stricter than function definition.

📖 Explanation: This application question emphasizes strategic variable selection. Convergence speed of $\sum c_k x^k$ depends critically on $|x|$. Smaller $|x|$ means faster decay of terms. $\sqrt{0.9} = (1-0.1)^{1/2}$ uses $x=-0.1$. Incorrectly setting $1+x=0.9 \Rightarrow x=-0.1$ is actually correct, but if a student mistakenly thinks they need $\sqrt{1+x}=0.9 \Rightarrow x=-0.19$ (confusing $f(x)=y$ with input), error grows. The key lesson: always frame the problem as $(1+\delta)^m$ with minimal $|\delta|$. This principle underpins efficient numerical algorithms.

📖 Explanation: This Olympiad-style question addresses computational mathematics. Directly computing $\binom{-1/2}{k}$ involves huge factorials and tiny fractions, risking floating-point errors. The recurrence $\binom{m}{k} = \binom{m}{k-1} \frac{m-k+1}{k}$ with $m=-1/2$ gives multiplier $\frac{-1/2-k+1}{k} = \frac{-(2k-1)}{2k}$. This keeps numbers moderate and maintains precision. Recognizing such recurrences is vital for implementing special functions in code. It also reveals structural properties: coefficients alternate sign and decrease monotonically for $x>0$, ensuring stability in summation.

📖 Explanation: This error analysis question targets procedural fluency. Integrating $(1+t^3)^{1/3} = \sum \binom{1/3}{k} t^{3k}$ yields $\sum \binom{1/3}{k} \frac{t^{3k+1}}{3k+1}$. Forgetting the '+1' in the exponent/denominator is a common mechanical mistake. At $t=0.5$, this produces wrong numerical values. The question reinforces that term-by-term integration requires careful handling of the variable transformation. It also implicitly tests understanding that the series variable is $t^3$, not $t$, complicating the antiderivative step compared to standard $x^k$ forms.

📖 Explanation: This graph-based conceptual question links visual intuition to analytic theory. All three functions share $R=1$, but the nature of the singularity at $x=-1$ differs. $m=-1.5$ has a non-integrable singularity ($p>1$ in $(1+x)^{-p}$), while $m=-0.5$ is integrable. Stronger singularities induce larger Taylor coefficients asymptotically, slowing convergence. Visually, the polynomial 'peels away' faster near the problematic endpoint. This teaches that convergence rate isn't binary; it's modulated by singularity strength, impacting practical approximation ranges.

📖 Explanation: This mixed-concept modeling question combines binomial approximation with error budgeting. Relative error $\approx \frac{\binom{t}{2}r^2}{tr} = \frac{(t-1)r}{2} \approx \frac{tr}{2}$ for large $t$. Setting $\frac{10r}{2} < 0.01$ gives $r < 0.002$. Options ignoring $t$ fail because exponent amplifies nonlinearity. This illustrates that 'small parameter' is context-dependent; $r=0.05$ might be small for $t=1$ but disastrous for $t=100$. Proper modeling requires scaling analysis, not just rote threshold memorization.

📖 Explanation: This direct recall question establishes foundational taxonomy. Geometric series $\sum (-x)^k = (1+x)^{-1}$ corresponds exactly to $m=-1$ in $(1+x)^m$. Binomial coefficients $\binom{-1}{k} = (-1)^k$ reduce to geometric ratios. For other $m$, coefficients become $\frac{m(m-1)\dots}{k!}$. Recognizing this unification simplifies learning: many series tests and properties for geometric series extend intuitively to binomial series. It also explains why both share $R=1$ (singularity at $x=-1$) except for integer $m \geq 0$.

📖 Explanation: This conceptual question addresses analytical rigor. A key theorem states that within $(-R, R)$, $\frac{d}{dx}\sum a_k x^k = \sum k a_k x^{k-1}$, and both share radius $R$. For binomial series, differentiating $\binom{m}{k}x^k$ yields $m \binom{m-1}{k-1} x^{k-1}$, reconstructing $m(1+x)^{m-1}$. Students often perform this mechanically without knowing it's justified by uniform convergence on compact subsets. Understanding this validates manipulating series as functions, bridging formal power series and calculus operations safely.

📖 Explanation: This application question teaches normalization technique. Standard binomial series requires leading 1. Writing $(4+x)^{1/2} = \sqrt{4(1+x/4)} = 2(1+x/4)^{1/2}$ isolates the perturbation $u=x/4$. Coefficients become $2 \binom{1/2}{k} (1/4)^k$, clean and tabulated. Direct expansion involves $\binom{1/2}{k} 4^{1/2-k}$, prone to arithmetic errors. Also, convergence $|x/4|<1 \Rightarrow |x|<4$ is immediately visible. This normalization is a universal skill in asymptotic analysis and perturbation theory, transforming arbitrary expressions into canonical forms.

📖 Explanation: This Olympiad-style reverse-engineering question tests deep pattern recognition. Coefficient $\frac{(2k)!}{(k!)^2 4^k} = \binom{2k}{k} / 4^k$ relates to $\binom{-1/2}{k} (-1)^k$. Specifically, $\binom{-1/2}{k} = \frac{(-1)^k \binom{2k}{k}}{4^k}$. Thus series is $\sum \binom{-1/2}{k} x^k = (1+x)^{-1/2}$. Identifying hidden binomial structures in combinatorial series is crucial in generatingfunctionology. Distractors reflect common misidentifications. Success requires familiarity with double-factorial identities and their link to fractional binomial coefficients, going beyond textbook examples.

📖 Explanation: This direct recall question reinforces the integer vs. non-integer dichotomy. $(1+x)^n$ for $n \in \mathbb{N}$ is a polynomial of degree $n$; binomial series terminates. For $n \notin \mathbb{N}$, series is infinite. At degree 10, $(1+x)^{10}$ is captured perfectly. $(1+x)^{10.1}$ still has nonzero $k=11,12,\dots$ terms. This isn't about approximation quality per se, but structural finiteness. Understanding this prevents wasting effort estimating remainders for polynomials and highlights why symbolic systems handle integer powers differently.

📖 Explanation: This application question focuses on self-validating computation. For $(1+x)^{1/3}$ with $x>0$, terms alternate and decrease in magnitude. Alternating Series Estimation Theorem guarantees $|Error| \leq |a_{n+1}|$. Computing $|a_5|$ provides a rigorous, a priori error bound without external reference. Averaging or stabilization heuristics lack guarantees. This skill is vital in scientific computing where true values are unknown. It reinforces checking series properties (alternating, decreasing) before applying error theorems, preventing misuse on non-alternating expansions.

📖 Explanation: This conceptual question dismantles a persistent myth. Domain of $f(x)=(1+x)^{-1}$ is $\mathbb{R} \setminus \{-1\}$. Series $\sum (-1)^k x^k$ converges only for $|x|<1$. At $x=2$, $f(2)=1/3$ exists, but series $1-2+4-8\dots$ diverges. This starkly separates function existence from series representation validity. Students must internalize that power series are local representations tied to expansion center and nearest singularity, not global function definitions. This counterexample is canonical because it's simple yet definitive.

📖 Explanation: This mixed-concept question combines series, integration, and physics. Uniform convergence on compact subsets of $(-R,R)$ justifies termwise integration. Here, argument $u=k^2\sin^2\phi \in [0,k^2]$. Since $|k|<1$, $u$ stays in $[0,1)$, avoiding the singularity at $u=1$. Uniform convergence holds, validating the elliptic integral expansion. If $k=1$, singularity hits endpoint, breaking uniformity and requiring improper integral treatment. Recognizing parameter-dependent convergence domains is essential in applied analysis, distinguishing safe regimes from singular limits.

📖 Explanation: This error analysis question targets computational precision. $\binom{0.5}{3} = \frac{(0.5)(-0.5)(-1.5)}{6} = \frac{0.375}{6} = 0.0625$. Signs: (+)(-)(-) = +. Common errors include dropping a negative or miscounting factors. For $(1+x)^{1/2}$, signs alternate: $+, +, -, +, - \dots$ Wait: $\binom{1/2}{0}=1, \binom{1/2}{1}=1/2, \binom{1/2}{2}=-1/8, \binom{1/2}{3}=1/16=0.0625$. So positive is correct. Tracking sign patterns helps catch arithmetic slips. This reinforces careful evaluation of generalized binomial coefficients, where intuition from integer cases fails.

📖 Explanation: This conceptual question addresses domain and form constraints. At $x=0$, $x^2-1 = -1$, so $\sqrt{-1}=i$. Real-valued expansion around 0 is impossible. Transforming to $i(1-x^2)^{1/2}$ yields valid complex series, or shifting to $x=1$ (let $x=1+t$) gives real expansion $\sqrt{2t+t^2}$. Recognizing when standard forms fail due to domain issues is critical. Students must check function reality and analyticity before applying templates. This prevents nonsensical real approximations of imaginary quantities.

📖 Explanation: This conceptual question unifies discrete and continuous math. For integer $n$, $\frac{n(n-1)\dots(n-k+1)}{k!} = \frac{n!}{k!(n-k)!}$ when $k \leq n$, and 0 when $k>n$ (since factor $n-n=0$ appears). This shows the analytic definition naturally extends and terminates the combinatorial one. Understanding this continuity explains why binomial theorem works universally. It also justifies using gamma functions for non-integers. This foundational link enriches understanding beyond mechanical computation.

📖 Explanation: This mixed-concept question links series to error analysis. Linear approximation uses f&#039;(x). Binomial series explicitly gives f&#039;&#039;(x), f&#039;&#039;&#039;(x) via coefficients: $f(x) \approx a_0 + a_1 x + a_2 x^2$. Uncertainty $\sigma_f^2 \approx (a_1 \sigma_x)^2 + (2a_2 x \sigma_x)^2 + \dots$. Including $a_2$ captures curvature effects missed linearly. For $x=0.1, \Delta x=0.01$, quadratic term may be significant. Series provide ready-made derivatives for Taylor-based uncertainty quantification, superior to finite differences for analytic functions.

📖 Explanation: This graph-based question visualizes convergence. For fixed $n$, truncation error $|R_n(x)|$ grows as $x$ approaches $R$ because $x^{n+1}$ increases. At $x=0.9<1$, error is finite but larger than at $x=0$. Monotonic increase confirms we're within convergence disk. Oscillation would suggest alternating series error bound behavior, but magnitude envelope still grows. Recognizing error profiles helps diagnose convergence issues: if error spiked near 0.9, might indicate proximity to singularity. Visual literacy complements analytic tests.

📖 Explanation: This Olympiad-style question probes complex analysis foundations. Singularity of $(1+z)^m$ occurs at $z=-1$ for any non-integer $m$ (branch point). Distance from expansion center 0 to -1 is 1, so $R=1$. Rationality doesn't remove singularity; $(1+z)^{1/2}$ still branches at -1. Only integer $m$ removes branching, giving $R=\infty$. Students confusing rational/irrational miss that analytic structure depends on integrality, not rationality. This underscores that convergence radii are geometric (distance to singularity), not arithmetic.

📖 Explanation: This error analysis question clarifies convergence criteria. $\binom{m}{k} \sim \frac{(-1)^k \Gamma(k-m)}{k! \Gamma(-m)} \sim C k^{-m-1}$. Polynomial decay $k^{-p}$ gives $R=1$ (ratio $\to 1$). Exponential decay $r^k$ gives $R=\infty$. Confusing decay rate with radius is common. Ratio test $|\frac{a_{k+1}}{a_k}| \to 1$ confirms $R=1$. Students must apply ratio/root tests, not just inspect coefficient limits. This reinforces that asymptotic behavior determines radius, not mere vanishing.

📖 Explanation: This challenging question explores advanced approximation strategies. Direct $(1+x)^{1/2}$ coeffs $\sim k^{-3/2}$. Integrated $\int (1+t)^{-1/2} dt$ gives same asymptotics. However, sometimes integrated forms have better numerical properties or connect to other functions (e.g., arcsinh). More importantly, if original series converges slowly at endpoint, integrated version may converge faster or allow analytic continuation. Also, integrating known series avoids re-deriving coefficients. While not always better, recognizing alternative representations expands toolkit. Question tests strategic thinking beyond default methods.

📖 Explanation: This conceptual question revisits domain vs. convergence. For $m=-1$, $f(x)=1/(1+x)$ defined for $x \neq -1$. Series $\sum (-x)^k$ converges only $|x|<1$. For $x=-2$, $f(-2)=-1$ exists, but series $\sum 2^k$ diverges. Representation fails outside $(-1,1)$. Even at $x=-1$, both undefined/divergent. Key: series is local representation, not global identity. Students must check convergence interval independently of function domain. This prevents erroneous extrapolation beyond valid range.

📖 Explanation: This application question links coefficient behavior to error control. For $m=0.5$, ratio $|c_k/c_{k-1}| = |\frac{1.5-k}{k}|$. For $k=1$: $0.5/1=0.5<1$. So decreases from start. Monotonic decrease + alternating signs = Alternating Series Test applicable. Error $\leq |next term|$. If terms increased initially, couldn't use simple bound until decrease began. Recognizing when monotonicity kicks in is crucial for valid error estimation. For $m>1$, initial growth occurs; for $m<1$, immediate decay. This informs adaptive truncation strategies.

📖 Explanation: This Olympiad-style question connects analysis to combinatorics. Generating function $G(x) = \sum \binom{m}{k} x^k = (1+x)^m$. Algebraic operations on $G(x)$ translate to combinatorial identities. E.g., $(1+x)^a (1+x)^b = (1+x)^{a+b}$ implies $\sum_j \binom{a}{j}\binom{b}{n-j} = \binom{a+b}{n}$. Differentiation gives $m(1+x)^{m-1} = \sum k \binom{m}{k} x^{k-1}$, yielding $\sum k \binom{m}{k} = m 2^{m-1}$. This analytic machinery solves discrete problems elegantly. Viewing series as generating functions unlocks powerful proof techniques beyond brute force.