📝 Maclaurin and Taylor Polynomials in calculus (36 MCQs)

📖 Explanation: This question targets error analysis regarding domain restrictions. A Maclaurin polynomial is specifically a Taylor polynomial centered at $x=0$. Since the natural logarithm function $\ln(x)$ is undefined at $x=0$, neither the function value nor any of its derivatives exist at that point. Therefore, constructing a Maclaurin series is mathematically impossible. The correct approach for approximating $\ln(x)$ near 1 is to use a Taylor series expansion centered at $x=1$, where the function is analytic and differentiable.

📖 Explanation: This requires synthesizing graphical interpretation with Taylor remainder concepts. The polynomial $P_2(x)$ matches $f(a)$, f&#039;(a), and f&#039;&#039;(a), ensuring identical position, slope, and concavity at $x=a$. However, since f&#039;&#039;&#039;(a) < 0, the actual function curves downward more sharply than the quadratic approximation for $x > a$. The leading error term is proportional to f&#039;&#039;&#039;(a)(x-a)^3. With a negative third derivative and positive $(x-a)$, the remainder is negative, meaning the true function value is less than the polynomial approximation.

📖 Explanation: This tests conceptual understanding of symmetry and derivative properties. Cosine is an even function, satisfying $f(-x) = f(x)$. Power series representations of even functions contain only even powers of $x$. Consequently, coefficients for odd powers like $x^3$ must be zero. Analytically, f&#039;&#039;&#039;(x) = \sin(x), and $\sin(0) = 0$. Thus, the coefficient c_3 = f&#039;&#039;&#039;(0)/3! vanishes. Both the symmetry argument and the direct derivative calculation provide valid, complementary explanations for why the approximation does not improve when moving from degree 2 to degree 3.

📖 Explanation: This application question emphasizes efficient computation via substitution rather than brute-force differentiation. The Maclaurin series for $e^u$ is $1 + u + u^2/2! + u^3/3! + \dots$. Substituting $u = -x^2$ yields $1 + (-x^2) + (-x^2)^2/2! + \dots$. Simplifying the quadratic term in $u$ gives $x^4/2$. Directly differentiating $e^{-x^2}$ four times involves repeated product and chain rules, which is prone to arithmetic errors. Substitution leverages known series structures, demonstrating a higher-order strategy for generating Taylor polynomials for composite functions efficiently and accurately.

📖 Explanation: This challenging question addresses the subtle distinction between infinite differentiability and analyticity. While $f(x) = e^{-1/x^2}$ (extended by continuity at 0) possesses derivatives of all orders at zero, every derivative equals zero. Thus, its Taylor series is identically zero. However, the function itself is non-zero for all $x \neq 0$. The series converges everywhere but only equals the function at the single point $x=0$. This proves that having all derivatives is necessary but not sufficient for a Taylor series to represent a function locally; the remainder term must also tend to zero.

📖 Explanation: This graph-based question requires interpreting geometric matching conditions. A first-degree Taylor polynomial matches value and slope (tangent line). A second-degree polynomial additionally matches concavity (second derivative). A third-degree polynomial must also match the rate of change of concavity, related to the third derivative and inflection point behavior. Curve C represents $P_2(x)$. Only Curve D satisfies the additional constraint imposed by the third derivative, making it the unique candidate for $P_3(x)$. Visual identification reinforces the concept that higher-degree polynomials capture increasingly local geometric features of the target function beyond simple tangency.

📖 Explanation: This scenario-based question connects Taylor polynomials to physical modeling. The linear approximation $\sin(\theta) \approx \theta$ corresponds to the first-degree Maclaurin polynomial. To improve accuracy while maintaining analytical tractability, one uses the next non-zero term in the series. Since sine is odd, the quadratic term vanishes. The third-degree Maclaurin polynomial is $\theta - \theta^3/3! = \theta - \theta^3/6$. Option B has the wrong sign. Option C is the cosine expansion. Option D abandons the polynomial model entirely. This illustrates how Taylor polynomials serve as systematic refinement tools in applied mathematics and physics.

📖 Explanation: This conceptual question tests understanding of Taylor polynomials applied to polynomials themselves. If $f(x)$ is a polynomial of degree $k$, its derivatives of order greater than $k$ are identically zero. When constructing the Taylor polynomial of degree $n > k$, all coefficients for powers $x^{k+1}$ through $x^n$ vanish. The resulting series terminates exactly at degree $k$ and reproduces $f(x)$ perfectly. There is no remainder or approximation error. This highlights that Taylor polynomials generalize polynomial representation and become exact when the target function is already within the polynomial space.

📖 Explanation: This error analysis question focuses on careful application of generalized binomial coefficients or derivative formulas. Using the binomial series $(1+x)^m$ with $m=1/2$, the coefficient of $x^2$ is $m(m-1)/2! = (1/2)(-1/2)/2 = -1/8$. Alternatively, f&#039;&#039;(x) = -1/4(1+x)^{-3/2}, so f&#039;&#039;(0) = -1/4, and dividing by $2!$ gives $-1/8$. The first student likely forgot to divide by factorial or made an arithmetic error. Recognizing standard binomial expansions prevents computational mistakes and serves as a verification tool for derivative-based calculations.

📖 Explanation: This mixed-concept question integrates convergence theory with practical numerical analysis. While the Maclaurin series for $\ln(1+x)$ does converge at $x=0.1$, the error bound in Taylor's theorem depends on $|x-a|^{n+1}$. Centering at $a=1$ makes $|1.1-1| = 0.1$, whereas centering at $a=0$ for $\ln(1+x)$ effectively evaluates at $x=0.1$ as well, but the derivatives grow factorially. More fundamentally, choosing a center close to the target minimizes the distance term in the Lagrange remainder, accelerating convergence and reducing required polynomial degree for fixed accuracy. This reflects strategic thinking in approximation theory.

📖 Explanation: This conceptual question leverages function parity to predict series structure. The product of an odd function ($\sin x$) and an even function ($\cos x$) is always odd. An odd function satisfies $g(-x) = -g(x)$. In a power series representation, this symmetry forces all even-powered coefficients to be zero. Thus, without computing any products or derivatives, we know the Maclaurin polynomial for $\sin(x)\cos(x)$ contains exclusively odd powers. This insight saves computation time and provides a built-in consistency check. It also connects algebraic symmetry properties directly to analytic series representations, reinforcing deep structural understanding.

📖 Explanation: This application question tests proper use of error estimation theory. The Lagrange remainder $R_n(x) = f^{(n+1)}(z)(x-a)^{n+1}/(n+1)!$ requires bounding the (n+1)th derivative on the entire interval between center and evaluation point. For $e^x$, the fifth derivative is $e^z$, maximized at $z=0.5$. Simply evaluating the polynomial or checking endpoint convergence ignores the derivative bound essential to the theorem. Assuming error equals the next term is only valid for alternating series meeting specific criteria, not universally. Rigorous validation demands identifying the worst-case derivative magnitude across the relevant domain.

📖 Explanation: This conceptual clarification addresses common terminology confusion. A Taylor polynomial $P_n(x)$ is a finite sum of n+1 terms, usable for numerical approximation anywhere but with error growing outside the convergence zone. The Taylor series is the infinite limit of these polynomials, representing the function exactly only where it converges. For $1/(1-x)$, the series $\sum x^k$ converges only for $|x|<1$. Outside this interval, the series diverges despite the polynomial being computable. Understanding this distinction prevents misapplying infinite series results to finite approximations and vice versa.

📖 Explanation: This foundational concept question probes the precise link between polynomials and function representation. Infinite differentiability alone doesn't guarantee series convergence to the function. The equality holds precisely when the sequence of remainders tends to zero. This is the content of Taylor's theorem with remainder. Analyticity is equivalent to this condition holding on an open interval, but for a single point, the remainder limit is the definitive criterion. Positive radius ensures series convergence but not necessarily to f(x). This distinction is crucial for understanding pathological cases like flat functions and validates the theoretical basis of series approximations.

📖 Explanation: This direct recall/application hybrid identifies error sources in numerical methods. Truncation error arises from replacing an infinite process (series) with a finite one (polynomial). Here, terms like $x^4/24$ were omitted, creating systematic deviation from the true value. Roundoff error relates to finite precision arithmetic, which is negligible here given simple decimals. Measurement and algorithmic errors are irrelevant to pure mathematical approximation. Recognizing truncation error as inherent to polynomial approximation guides decisions about polynomial degree selection versus precision management, forming the basis of numerical analysis error budgeting.

📖 Explanation: This comparative analysis question examines practical convergence rates. Although both series converge everywhere, the rate depends on term magnitudes. For $e^x$ at x=2, terms peak around k=2 then decay factorially. For $e^{-x^2}$ at x=2, the series becomes $\sum (-4)^k/k!$. Terms grow until k≈4 before decaying, requiring more summation to reach asymptotic decay regime. The squared argument amplifies effective magnitude in early terms. This demonstrates that infinite radius doesn't imply uniform efficiency; argument scaling dramatically impacts computational cost, guiding adaptive algorithm design in scientific computing.

📖 Explanation: This theoretical justification question connects calculus operations to series convergence properties. Termwise integration isn't automatic for all series; it relies on uniform convergence. Power series possess the special property of uniform convergence on compact subsets within their open interval of convergence. This strong convergence mode allows swapping limits (integration) and summation. Mere pointwise convergence wouldn't suffice. Understanding this justification prevents erroneous manipulation of series outside valid domains and explains why endpoint behavior may differ after integration. It bridges elementary calculus techniques with rigorous analysis foundations underlying series operations.

📖 Explanation: This applied modeling question translates physical constraints into series approximation. Let $u = v^2/c^2$. Since $v \ll c$, $u \ll 1$. The binomial expansion $(1+u)^{1/2} \approx 1 + (1/2)u - (1/8)u^2 + \dots$. Keeping terms through second order in $v/c$ means keeping through first order in $u$ (since $u$ is already second order). Thus, $1 + v^2/(2c^2)$. Option B has wrong sign. Options C and D include incorrect powers or coefficients. This demonstrates extracting dominant physical behavior via controlled truncation, essential for perturbation theory and simplified model derivation.

📖 Explanation: This reverse-engineering question tests understanding of coefficient-derivative relationships. The Taylor polynomial coefficient for $x^k$ is $f^{(k)}(0)/k!$. Here, the $x^3$ coefficient is -1. Therefore, f&#039;&#039;&#039;(0)/3! = -1, implying f&#039;&#039;&#039;(0) = -6. Note the missing $x^2$ term means f&#039;&#039;(0)=0, and constant/linear terms give f(0)=3, f&#039;(0)=2. Students often forget the factorial denominator or misidentify term positions. This skill enables extracting derivative information from known series expansions without differentiation, useful in differential equations and spectral methods where series solutions are primary objects.

📖 Explanation: This error analysis question highlights convergence boundary effects. While $1/(1-x)$ is smooth at 0, its Taylor series has radius 1 due to singularity at x=1. At x=0.9, we're near the convergence boundary where partial sums oscillate wildly before settling. Fifth-degree polynomial gives poor approximation despite smoothness because geometric decay is slow near radius edge. Other options involve either excellent approximations (sin/cos/eˣ near centers) or appropriate centers. This teaches that smoothness at expansion point doesn't guarantee good global approximation; distance to nearest singularity governs practical utility, emphasizing complex analysis connections to real approximation theory.

📖 Explanation: This identification and reasoning question combines pattern recognition with functional composition understanding. The given series is definitively $\cos(x)$: alternating signs, even powers, even factorials. Substituting $x^2$ into $\cos(u) = \sum (-1)^k u^{2k}/(2k)!$ yields $\cos(x^2) = \sum (-1)^k x^{4k}/(2k)!$, which has powers 0,4,8,... not 0,2,4,... Thus, simple substitution cannot generate $\cos(x)$ from another elementary series via $x \to x^2$. This distinguishes between function composition and variable transformation, preventing mechanical misapplication of substitution techniques and reinforcing careful exponent tracking in series manipulations.

📖 Explanation: This method comparison question evaluates advantages of series-based integration. The integrand lacks elementary antiderivative, ruling out symbolic closed-form. Numerical quadrature gives decimal answers but opaque error estimates. Series integration produces $\sum (-1)^k x^{2k+1}/((2k+1)k!)$, an alternating series for positive x. Alternating series estimation theorem provides simple, rigorous error bounds via first neglected term. This transparency enables guaranteed accuracy specifications impossible with black-box numerics. The approach exemplifies how analytical structure facilitates certified computation, bridging pure and applied mathematics in scientific problem-solving contexts requiring verified results.

📖 Explanation: This conceptual error analysis addresses degree-function mismatch. While $P_2(x) = 0$ is mathematically correct (derivatives up to order 2 vanish), concluding 'approximately zero' misses that the dominant local behavior is cubic. Degree 2 truncation discards essential information. Using degree ≥3 captures $x^3$ exactly. The flaw isn't computational but interpretive: low-degree approximation of high-order vanishing functions loses leading-order dynamics. This teaches appropriate degree selection based on expected function behavior and warns against overinterpreting zero approximations as indicating negligible magnitude rather than insufficient resolution of local structure.

📖 Explanation: This comparative question examines incremental improvement conditions. For $x^2$ and $e^{-x^2}$, odd derivatives at 0 vanish, so $P_3 = P_2$. For $\cos(x)$, $P_3 = P_2$ since sine derivative is zero. Only $\sin(x)$ has non-zero third derivative ($-\cos(0)=-1$), making $P_3(x) = x - x^3/6$ distinct from $P_2(x) = x$. The cubic term improves approximation by capturing curvature change. This highlights that degree increase only helps when corresponding derivative is non-zero, connecting algebraic construction to geometric feature capture and informing efficient approximation strategies.

📖 Explanation: This application-context question links series methods to ODE theory. Taylor series solution assumes $y(x) = \sum a_n (x-x_0)^n$. Coefficients relate to derivatives: $a_n = y^{(n)}(x_0)/n!$. Initial conditions specify y(x_0), y&#039;(x_0), \dots, directly determining first coefficients. Without this anchoring, the series remains undetermined. Higher derivatives follow from the DE itself via successive differentiation. Thus, initial conditions bootstrap the entire series construction. This reveals how local data propagates globally through analytic continuation, fundamental to existence-uniqueness theory and numerical series solvers for initial value problems.

📖 Explanation: This graph-based conceptual question maps polynomial degrees to geometric features. $P_0$ matches value. $P_1$ adds slope. $P_2$ adds concavity (second derivative). $P_3$ adds third derivative information, governing how concavity changes—essentially the 'jerk' or inflection tendency. Options A-C are matched by lower degrees. Only D requires cubic term. This hierarchical correspondence helps visualize what each polynomial degree contributes geometrically, aiding intuitive understanding of approximation quality and guiding degree selection based on desired feature fidelity in curve fitting and modeling applications.

📖 Explanation: This application question demonstrates series resolving singularities. Direct evaluation gives 0/0. Series: $\sin(x) = x - x^3/6 + \dots$. Dividing by x: $1 - x^2/6 + \dots$. Limit as x→0 is 1. Leading correction is quadratic with coefficient -1/6. This removable singularity handling is classic series utility in numerical analysis and physics. Option C has wrong coefficient (confusing with cosine). Option B misunderstands limit. Option D ignores series' power to extend functions analytically. The technique transforms indeterminate forms into well-behaved polynomials, enabling stable computation near problematic points.

📖 Explanation: This mixed-concept question explores composition effects on series coefficients. Substituting $x^2$ for x replaces each $x^k$ with $x^{2k}$. Thus, only even powers appear in g's expansion, with coefficient of $x^{2k}$ equaling original $a_k$. All odd-power coefficients vanish. This systematic sparsity pattern reflects the even symmetry induced by squaring the argument. Understanding such transformations enables rapid series generation for composed functions without re-differentiation. It also aids in recognizing series patterns and verifying correctness through parity checks, streamlining analytical work in advanced calculus and special functions.

📖 Explanation: This challenging question invokes the identity theorem for power series. If an analytic function vanishes on any open set within its disk of convergence, it must be identically zero throughout the disk. Consequently, all Taylor coefficients vanish. This profound rigidity distinguishes analytic functions from merely smooth ones (which can be zero on intervals without being globally zero). The result underpins uniqueness of series representations and analytic continuation. Recognizing this property prevents false assumptions about non-trivial functions with local zeros and is fundamental in complex analysis, differential equations, and mathematical physics where series solutions are central.

📖 Explanation: This comparative analysis evaluates error estimation strategies. For alternating series satisfying Leibniz criterion, error magnitude is bounded by first omitted term, which often closely tracks actual error. Lagrange remainder involves supremum of derivative over interval, potentially yielding loose bounds if derivative varies significantly. For $\ln(1+x)$, derivatives grow near -1, inflating Lagrange bound even when evaluating far from singularity. Alternating bound adapts to local term decay. This practical advantage makes alternating series preferable when applicable, illustrating how structural series properties enable sharper, more informative error control than generic calculus-based estimates.

📖 Explanation: This conceptual synthesis explains approximation efficacy. Small argument reduces numerator growth ($0.1^n$ decays geometrically). Factorial denominator accelerates decay further ($n!$ grows super-exponentially). Combined effect makes terms beyond quadratic utterly negligible at x=0.1. Neither factor alone suffices: large x with factorial still needs many terms; small x without factorial (geometric series) converges slower. Their synergy enables few-term accuracy. Understanding this interplay guides efficient computation: choose center to minimize |x-a|, leverage factorial decay. This principle underlies algorithm design in scientific libraries where argument reduction precedes series evaluation for optimal performance.

📖 Explanation: This advanced application question introduces rational approximation concepts. Standard Taylor polynomials optimize accuracy near single point, degrading toward interval edges. Padé approximants match function and derivatives using rational functions, often providing superior uniform accuracy over intervals with same number of parameters. Shifting center helps but still polynomial-limited. Adding terms increases degree (violates constraint). Precision doesn't address structural limitation. Padé exploits pole-zero placement to mimic function behavior globally. This represents sophisticated approximation strategy beyond basic Taylor theory, relevant in signal processing and numerical analysis where interval-wide fidelity matters more than pointwise optimality.

📖 Explanation: This conceptual question addresses operation effects on convergence. Integration of power series preserves radius of convergence R. Endpoint behavior may change (convergence possible where original diverged), but radius itself remains R. Thus, integrated series has radius exactly 2, meaning 'at least 2' is technically true but imprecise. However, among options, 'at least 2' safely encompasses the guaranteed preservation without overstating. 'Exactly 2' is correct but sometimes excluded if endpoints gain convergence. Standard theorem states radius unchanged. This nuance matters in boundary analysis but core principle is radius invariance under integration/differentiation, distinguishing from operations like multiplication that may alter radii.

📖 Explanation: This practical methodology question justifies series manipulation strategies. Direct nth derivative of product involves sum of n+1 terms via Leibniz rule, each requiring product derivatives—computationally explosive. Known series for exponential and cosine are simple, tabulated, and easily multiplied via Cauchy product or direct distribution. Modular approach separates concerns: compute each factor independently, combine algebraically. Reduces error risk and enhances reusability. This divide-and-conquer philosophy permeates applied mathematics, enabling complex function handling through composition of simpler building blocks. Efficiency gains scale dramatically with order, making multiplication indispensable for higher-order perturbation analysis and symbolic computation systems.

📖 Explanation: This pattern recognition question connects coefficient sequences to known functions. Constructing polynomial: $1 + 0x -2x²/2! + 0x³/3! + 24x⁴/4! = 1 - x² + x⁴$. Compare to known series: cos(x) = 1 - x²/2 + x⁴/24 (coefficients don't match). e^{-x²} = 1 - x² + x⁴/2 - ... (matches first three terms exactly). 1/(1+x²) = 1 - x² + x⁴ - ... (alternating signs match but e^{-x²} factorial pattern fits given derivatives better). Given f⁽⁴⁾(0)=24=4!, consistent with e^{-x²} expansion where coefficient of x⁴ is 1/2! = 12? Wait: e^{-x²} x⁴ term is (-x²)²/2! = x⁴/2, so f⁽⁴⁾ should be 24*(1/2)=12. But given 24 implies coefficient 1, matching 1/(1+x²) = 1 - x² + x⁴. Rechecking: 1/(1+x²) fourth derivative at 0 is indeed 24. Answer corrected to C based on exact coefficient match.

📖 Explanation: This foundational error analysis identifies differentiability as prerequisite. Taylor polynomials require existence of derivatives up to desired order at expansion point. |x| lacks first derivative at 0 (left/right derivatives disagree). Thus, even P₁ is undefined. No higher-degree polynomial can compensate for missing first derivative. Continuity alone insufficient. This contrasts with smooth non-analytic functions where polynomials exist but fail to converge. Here, construction itself breaks down. Recognizing differentiability requirements prevents futile approximation attempts and motivates alternative methods (piecewise polynomials, splines) for non-smooth functions in numerical analysis and engineering applications involving corners or cusps.