📝 Limit of a sequence calculus (32 MCQs)

📖 Explanation: This question targets the critical distinction between the limit of a sequence and the limit of a function. While it is true that if $\lim_{x \to +\infty} f(x) = L$, then $\lim_{n \to +\infty} f(n) = L$, the converse is false. A function may oscillate wildly between integer points even if it hits specific values at every integer. The sequence samples only discrete points, potentially missing the behavior of the continuous function between those integers. Therefore, convergence of the sequence does not guarantee convergence of the underlying continuous function.

📖 Explanation: This error analysis question addresses a common procedural misconception. L'Hôpital's Rule applies to differentiable functions defined on continuous intervals. A sequence $a_n$ is a function with a domain of discrete integers, making it non-differentiable in the standard calculus sense. To use L'Hôpital's Rule correctly, one must first extend the sequence to a continuous function $f(x)$ defined for all real $x \geq 1$. Only after establishing this continuous extension can derivatives be taken. Simply differentiating the discrete terms ignores the foundational requirements of the theorem regarding continuity and differentiability.

📖 Explanation: This graph-based interpretation question tests the precise understanding of the epsilon-N definition of convergence. The visual description of oscillation with decreasing amplitude corresponds to the formal statement that for any chosen tolerance $\epsilon$, we can find a threshold index $N$ beyond which all terms remain within that tolerance of the limit. Option B reverses the quantifiers, which is a common logical error describing boundedness rather than convergence. Option C invokes the Bounded Monotone Theorem incorrectly, as oscillating sequences are not monotone. Option D relies on averaging, which is irrelevant to the definition of a limit.

📖 Explanation: This application question involves recursively defined sequences often found in biological modeling. While setting $L = \sqrt{L+6}$ yields potential solutions $L=3$ and $L=-2$, mathematical rigor requires validation. Since the recursive formula uses the principal square root, all terms $P_n$ must be non-negative, eliminating $L=-2$. Furthermore, confirming convergence typically involves checking if |f&#039;(L)| < 1, which ensures the fixed point is attractive rather than repulsive. This multi-step reasoning connects algebraic solution techniques with analytical stability criteria essential for validating models in applied mathematics contexts.

📖 Explanation: This conceptual question targets the specific misconception that boundedness implies convergence. While the Monotone Convergence Theorem states that a bounded *monotone* sequence converges, boundedness alone is insufficient. The sequence $(-1)^n$ is clearly bounded between -1 and 1 but oscillates forever without approaching a single value. Option A converges to 1. Option C converges to 0 via the Squeeze Theorem. Option D is also a valid example of divergence, but $(-1)^n$ is the canonical counterexample used to distinguish boundedness from convergence in introductory analysis. Understanding this distinction is crucial before applying more advanced convergence tests.

📖 Explanation: This mixed concept question addresses the dangerous intuition trap of $1^\infty$ forms. Students often incorrectly apply limit laws separately to the base and exponent. However, $1^\infty$ is indeterminate because the rate at which the base approaches 1 competes with the rate at which the exponent grows. The actual limit is Euler's number $e \approx 2.718$. Recognizing this as an indeterminate form is a higher-order skill that prevents erroneous simplification. Proper resolution typically involves taking the natural log to convert the expression into a $0 \cdot \infty$ or $0/0$ form suitable for L'Hôpital's Rule or recognizing the standard definition of $e$.

📖 Explanation: This challenging question probes the technical conditions of the Squeezing Theorem. Standard textbook statements often say 'for all n', but rigorous analysis focuses on asymptotic behavior. Limits concern the behavior as $n \to +\infty$, so finite exceptions or undefined points in a sparse subset do not invalidate the conclusion, provided the sequence is well-defined on an infinite subsequence that captures the limit. However, in strict introductory contexts, some might argue D. But analytically, if the domain of $b_n$ allows $n \to +\infty$ (e.g., even integers), and the squeeze holds on that domain, the limit exists. This tests deep understanding versus rote memorization of theorem hypotheses.

📖 Explanation: This error analysis question highlights a subtle but critical algebraic nuance in sequence limits. While sequences typically start at $n=1$, understanding the underlying function behavior is vital. The identity $\sqrt{n^2} = n$ is only true for $n \geq 0$. If analyzing the corresponding function $f(x)$ as $x \to -\infty$, $\sqrt{x^2} = |x| = -x$, leading to a limit of -1. Even in sequence contexts, students who mechanically divide without considering absolute value properties may fail when problems involve alternating signs or extensions to negative indices. This reinforces the need for algebraic precision over algorithmic memorization.

📖 Explanation: This comparative analysis question moves beyond simple limit calculation to understanding convergence dynamics. Although $b_n$ oscillates and $a_n$ decreases monotonically, their absolute errors $|a_n - 0|$ and $|b_n - 0|$ are identical: both equal $1/n$. Therefore, for any given $\epsilon$, the required index $N$ to satisfy the convergence definition is exactly the same for both. This distinguishes the magnitude of convergence from the path taken to reach the limit. Students often confuse oscillatory behavior with slower or faster convergence, but here the envelope of decay dictates the rate equally for both sequences.

📖 Explanation: This modeling/scenario question bridges theoretical calculus and computational practice. Numerical evidence is suggestive but never constitutive of proof. Round-off errors can artificially stabilize divergent processes. Limited display precision might hide tiny oscillations (period-2 cycles). Most importantly, empirical observation cannot verify the analytical conditions (like contraction mapping) needed to guarantee convergence. This HOTS question emphasizes that in applied mathematics, computation guides conjecture, but rigorous analysis confirms truth. It warns against the 'calculator trap' where students accept displayed digits as mathematical fact without theoretical backing.

📖 Explanation: This conceptual question tests the 'eventual' nature of limits. By definition, for $\epsilon = L/2 > 0$, there exists $N$ such that for all $n > N$, $|a_n - L| < L/2$, implying $a_n > L/2 > 0$. This guarantees that beyond index $N$, all terms are positive. Consequently, only the finite set of terms $\{a_1, ..., a_N\}$ could possibly be negative. Option A is too strong (early terms can be anything). Option C is true but weaker than B. Option D confuses positivity with monotonicity. Understanding 'eventually' is key to mastering sequence topology.

📖 Explanation: This application question addresses the $\infty - \infty$ indeterminate form. Intuitive subtraction fails because the small difference between two large numbers matters significantly. Rationalizing the numerator transforms the expression into $\frac{n}{n + \sqrt{n^2+n}}$, which simplifies to $\frac{1}{1+\sqrt{1+1/n}} \to 1/2$. Alternatively, binomial expansion of $\sqrt{n^2+n}$ yields $n(1 + 1/(2n) - ...) \approx n + 1/2$, making the difference clear. This demonstrates that standard algebraic manipulation or series expansion is required to extract meaningful finite limits from seemingly cancelling infinities, correcting the student's flawed intuition.

📖 Explanation: This Olympiad-style/theoretical question connects sequence convergence to the foundational structure of real numbers. The Monotone Convergence Theorem relies on the existence of a least upper bound (supremum). In the rational numbers $\mathbb{Q}$, the set $\{x \in \mathbb{Q} : x^2 < 2\}$ is bounded above but has no supremum in $\mathbb{Q}$. Thus, a monotone sequence approximating $\sqrt{2}$ would fail to converge within $\mathbb{Q}$. The Completeness Axiom fills this gap by ensuring every bounded set in $\mathbb{R}$ has a supremum, guaranteeing that bounded monotone sequences actually have a destination. This distinguishes calculus from mere arithmetic.

📖 Explanation: This mixed-methods question asks students to select optimal strategies. While Ratio Test shows convergence of the series (implying term goes to 0), and Stirling's gives asymptotics, the Squeezing Theorem offers an elementary and elegant proof. Noting $0 \leq \frac{n!}{n^n} = \frac{1}{n} \cdot \frac{2}{n} \cdots \frac{n}{n} \leq \frac{1}{n} \cdot 1 \cdots 1 = \frac{1}{n}$, and since $1/n \to 0$, the limit is 0. This avoids heavy machinery. Evaluating method efficiency is a higher-order skill. L'Hôpital fails directly on factorials. Integral test is for series. Recognizing the simplest sufficient tool demonstrates deep conceptual mastery over brute-force computation.

📖 Explanation: This graph interpretation question tests the universal quantifier ('for all') in the limit definition. Clustering or high density is insufficient; convergence demands that *no* exceptions exist beyond the threshold $N$. Even rare spikes violating the $\epsilon$-band disprove convergence. This distinguishes statistical concentration from analytical limits. Students accustomed to data trends may mistakenly accept 'mostly close' as convergence. The formal definition is unforgiving: a single outlier past $N$ invalidates the limit. This reinforces the precision required in analysis versus descriptive statistics.

📖 Explanation: This advanced modeling question links fixed-point algebra to dynamical systems theory. Solving $L=2L(1-L)$ gives $L=0$ or $L=0.5$. However, the logistic map parameter $r=2$ lies in a region where fixed points can become unstable, leading to periodic orbits or chaos. Simply finding algebraic solutions ignores stability. One must analyze |f&#039;(L)| or iterate numerically to ensure the system settles rather than cycles. This integrates calculus with nonlinear dynamics, showing that in recursive models, existence of a solution does not imply attainability of that solution as a limit.

📖 Explanation: This conceptual distinction is fundamental to infinite series. The limit of terms being zero is a *necessary* condition for series convergence (Divergence Test contrapositive) but not *sufficient*. The harmonic series $\sum 1/n$ proves insufficiency: terms vanish yet sum diverges. Conversely, if partial sums converge to $S$, then $a_n = s_n - s_{n-1} \to S-S=0$, proving necessity. Understanding this asymmetry prevents the common 'Divergence Test Fallacy' where students assume vanishing terms guarantee summability. This logical directionality is a core HOTS concept in analysis.

📖 Explanation: This direct application question checks proper setup of the Squeeze Theorem. Since $-1 \leq \sin n \leq 1$, dividing by $n > 0$ yields $-1/n \leq b_n \leq 1/n$. Both bounds converge to 0, forcing $b_n \to 0$. Option A bounds are constant and don't converge to same limit. Option C is invalid since $\sin n$ can be negative. Option D is false since $|\sin n / n|$ is not always $\leq 1/n^2$. Selecting correct, tight bounds that share a common limit is the essential mechanical skill for applying this theorem effectively.

📖 Explanation: This conceptual refinement question upgrades naive intuition. While $\sqrt[n]{n} \to 1$, $\sqrt[n]{a^n} \to a$. For sums of exponentials, the largest base dominates. Factoring out $3^n$ reveals $3 \cdot \sqrt[n]{1+(2/3)^n} \to 3 \cdot 1 = 3$. The student's heuristic fails for exponential sums. This teaches that 'nth root behavior' depends critically on whether the radicand is polynomial (limit 1) or exponential (limit equals base). Distinguishing these regimes is essential for correctly applying the Root Test later in series analysis.

📖 Explanation: This application question generalizes the definition of $e$. Using substitution or log-limits: $\ln y = n \ln(1+k/n) \approx n(k/n) = k$, so $y \to e^k$. This connects abstract limits to financial/mathematical modeling (continuous growth). Students must recognize the structural form $(1 + \text{small})^{\text{large}}$ and adjust for the coefficient. Misconceptions include thinking $e$ is invariant or linear scaling applies. Understanding parametric dependence demonstrates flexibility in manipulating fundamental limits beyond rote memorization of the $k=1$ case.

📖 Explanation: This error analysis/conceptual hybrid examines pathological sequences. Unlike $n/\cos n$ which is merely unbounded, $n/\sin n$ is undefined whenever $n$ is a multiple of $\pi$ (never for integer $n$, wait—$\sin n \neq 0$ for integer $n$ since $\pi$ is irrational). Correction: For integer $n$, $\sin n \neq 0$. However, $\sin n$ gets arbitrarily close to 0, causing massive spikes. The sequence is unbounded AND oscillates in sign. Thus, it lacks a finite or infinite limit. Recognizing that 'undefined' isn't the issue for integers, but rather unbounded oscillation due to density of $\sin n$ near 0, requires sophisticated number-theoretic insight.

📖 Explanation: This procedural HOTS question validates the mechanics of epsilon-delta proofs. Correct simplification: $\frac{3(2n+1)-2(3n-4)}{3(3n-4)} = \frac{6n+3-6n+8}{3(3n-4)} = \frac{11}{3(3n-4)}$. Setting this $< \epsilon$ and solving for $n$ yields the precise bound. Option D has incorrect denominator algebra. Options B and C ignore the difference structure. Mastery of this algebra is essential for transitioning from intuitive limits to rigorous proof. It tests attention to detail in fraction arithmetic within the context of quantifier logic.

📖 Explanation: This conceptual/application question links mathematical form to physical interpretation. While both sequences have identical absolute decay rates ($0.9^n \to 0$), the negative base introduces alternation. In modeling, this represents oscillation (e.g., underdamped spring crossing equilibrium). Pure exponential decay ($y_n$) represents monotonic relaxation. Recognizing that sign alternation encodes dynamic behavior (oscillation vs. decay) is crucial for interpreting mathematical results in scientific contexts. The limit is the same, but the *path* to the limit carries distinct physical meaning.

📖 Explanation: This challenging/error analysis question exposes a subtle hypothesis in limit laws. The quotient rule assumes $b_n \neq 0$ for sufficiently large $n$. If $M \neq 0$, this is *usually* guaranteed by convergence, but pathological constructions or specific definitions might allow zeros. More practically, if the problem doesn't guarantee $b_n \neq 0$, division is undefined. However, standard theory says if $M \neq 0$, then eventually $|b_n| > |M|/2 > 0$, so zeros stop occurring. Thus, technically A is correct in standard analysis. But if considering pre-limit terms or non-standard domains, C matters. For standard calculus, A is the intended answer testing confidence in theorem conditions.

📖 Explanation: This graph-based question identifies divergence signatures. Visiting two distinct values infinitely often violates the uniqueness of limits. If a sequence converged to $L$, eventually all points must stay near $L$; they cannot keep returning to a distant cluster. Random scatter (A) might still converge if variance shrinks. Asymptotes (C) suggest convergence. Getting closer (D) suggests Cauchy/convergence. Identifying persistent multi-cluster behavior as definitive divergence connects visual pattern recognition to the formal definition's requirement of eventual confinement to an arbitrary neighborhood.

📖 Explanation: This comparative methods question evaluates strategic choice. Factoring gives $n^2(\sqrt{1+1/n^2}-1)$, which is indeed $\infty \cdot 0$. You'd then need Taylor/binomial expansion to resolve $\sqrt{1+x}-1 \approx x/2$. Conjugate multiplication directly produces $\frac{n}{\sqrt{n^2+1}+n} \to 1/2$ via simple division. While both work, conjugate is often more accessible to students lacking series tools. Recognizing when algebraic rationalization trumps asymptotic expansion is a valuable problem-solving heuristic that optimizes computational effort based on available toolkit.

📖 Explanation: This conceptual verification question tests the Continuous Composition Theorem. Since $g(x)=\arctan x \to \pi/2$ and $f(y)=\sin y$ is continuous at $\pi/2$, $\lim f(g(n)) = f(\lim g(n))$ holds. The fact that arctan never equals $\pi/2$ is irrelevant; limits concern approach, not attainment. Continuity bridges the gap. This reinforces that well-behaved functions preserve limits under composition, a cornerstone of calculus allowing complex limit evaluation via decomposition. Confirming validity builds confidence in legitimate shortcuts.

📖 Explanation: This conceptual hierarchy question establishes growth ordering. Despite $n^{100}$ seeming huge, $e^n$ eventually overwhelms it. This 'exponential beats polynomial' principle is fundamental for limits and series tests (Ratio Test). Students sometimes think high-degree polynomials win; this misconception must be corrected. Understanding this hierarchy allows quick limit assessment without repeated L'Hôpital applications. It also underpins computational complexity theory and algorithm analysis, linking pure math to computer science foundations.

📖 Explanation: This Olympiad/modeling nuance question addresses recursive sequence initialization. Newton's method for square roots converges quadratically, but monotonicity depends on starting guess. If $a_1 < \sqrt{S}$, then $a_2 > \sqrt{S}$, and monotonic decrease begins only from $a_2$. Proving properties 'eventually' accommodates transient initial behavior. This reflects real-world modeling where systems settle into predictable regimes after startup transients. Rigorous analysis must account for these edge cases rather than assuming ideal behavior from step one.

📖 Explanation: This terminology/conceptual question clarifies divergence vocabulary. Saying 'converges to infinity' is technically incorrect in standard analysis; convergence implies finite limits. Instead, we say 'diverges to $+\infty$' to specify the mode of divergence (unbounded growth vs. oscillation). Precision in language reflects precision in thought. Option A is a common colloquialism but mathematically sloppy. Option C describes oscillatory divergence. Option D contradicts unboundedness. Mastering this vocabulary ensures clear communication of analytical results.

📖 Explanation: This direct application of the Null Sequence Theorem is fundamental. Product of null sequence and bounded sequence is null. Proof: $|a_n b_n| \leq M|a_n| \to 0$. This result is frequently used in squeeze arguments and series tests. Students sometimes incorrectly think boundedness of $b_n$ is insufficient or require $b_n$ convergence. Recognizing that vanishing factor dominates bounded factor simplifies many limit evaluations. It's a powerful tool that bypasses need for $b_n$'s specific limit.

📖 Explanation: This advanced modeling/challenging question connects convergence rate to practical computation. Linear convergence ($K<1$) reduces error by fixed factor, adding ~constant digits. Quadratic convergence squares error, roughly doubling correct digits each iteration. This explains Newton's Method superiority. Understanding rate classifications helps select algorithms for desired precision. Students rarely encounter this in basic calculus but it's vital for numerical analysis. It elevates limit concepts from theoretical existence to quantitative efficiency assessment.