📝 How to test for monotonicity (31 MCQs)

📖 Explanation: This question targets error analysis and conceptual understanding. While the student's intuition about asymptotic behavior is correct regarding the limit, it fails to address local monotonicity. A sequence can oscillate or increase initially even if the denominator dominates eventually. Rigorous testing requires analyzing $a_{n+1} - a_n$ or f'(x) to ensure the property holds for all relevant indices, not just asymptotically.

📖 Explanation: This application question highlights the utility of calculus in discrete settings. Direct difference or ratio methods become algebraically cumbersome with transcendental functions like $\ln n$. Defining a continuous extension $f(x)$ allows the use of derivatives. Since f'(x) = \frac{1-\ln x}{x^2}, the function decreases when $\ln x > 1$, implying $x > e$. Thus, monotonicity holds for integers $n \geq 3$.

📖 Explanation: This graph-based HOTS question challenges the misconception that 'settling down' implies monotonicity. Even if $f(x) \to L$ with decaying oscillations (e.g., $\frac{\sin x}{x}$), the discrete samples $f(n)$ may still alternate above and below $L$ depending on the phase. Monotonicity requires consistent ordering, which oscillatory behavior typically violates unless the sampling rate specifically aliases the oscillation into a monotonic pattern.

📖 Explanation: This scenario-based question integrates modeling with rigorous proof techniques. Recursive sequences often require inductive arguments alongside monotonicity tests. Simply checking the ratio at one step isn't enough; one must prove the condition persists. The difference $P_{n+1} - P_n = \frac{P_n(K-A-P_n)}{A+P_n}$ is positive precisely when $P_n < K-A$. Induction confirms this bound is maintained, linking monotonicity directly to the biological constraint of carrying capacity.

📖 Explanation: This error analysis question addresses a fundamental logical gap: conflating convergence with monotonicity. While $n^{1/n}$ does eventually decrease, proving this requires analyzing f&#039;(x) or differences. The limit tells us the destination, not the path. A sequence like $1 + \frac{(-1)^n}{n}$ also converges to 1 but is never monotone. Students must distinguish between asymptotic behavior and the structural ordering of terms required for monotonicity.

📖 Explanation: This conceptual question asks students to evaluate methodological efficiency. While differences work theoretically, factorials create unwieldy expressions in subtraction. Ratios exploit the multiplicative structure of $n!$ and $n^n$, yielding $\frac{(n+1)!}{(n+1)^{n+1}} \cdot \frac{n^n}{n!} = \frac{n^n}{(n+1)^n} = (1+\frac{1}{n})^{-n}$. Recognizing this as related to $1/e$ provides immediate insight into monotonicity (since $(1+1/n)^n$ increases to $e$, its reciprocal decreases), demonstrating deep structural understanding.

📖 Explanation: This mixed-concept question links boundedness and monotonicity in recursive definitions. For $a_{n+1} > a_n$, we need $\sqrt{2+a_n} > a_n$. Squaring gives $2+a_n > a_n^2 \iff a_n^2 - a_n - 2 < 0 \iff (a_n-2)(a_n+1) < 0$. This holds only if $-1 < a_n < 2$. Thus, establishing the upper bound $a_n < 2$ is a prerequisite for proving increase, illustrating how properties are interdependent in recursive analysis.

📖 Explanation: This foundational question clarifies terminology through counterexample. Option C explicitly violates monotonicity at the start ($a_1=10, a_2=0.5$) but follows $1/n$ thereafter, making it eventually decreasing. Option B is never monotone due to persistent oscillation. Option D is eventually increasing but starts decreasing. Understanding this distinction is crucial because convergence theorems often rely only on eventual behavior, whereas strict definitions require global consistency.

📖 Explanation: This question tests precision in translating continuous results to discrete domains. If f&#039;(x) > 0 strictly for $x > 5.7$, then $f(6) > f(5.7)$, but the relationship between $f(5)$ and $f(6)$ depends on behavior in $[5, 6]$. Since f&#039; might be negative in $[5, 5.7]$, $a_5$ could exceed $a_6$. The safe integer threshold is the ceiling of 5.7, i.e., $n \geq 6$.

📖 Explanation: This higher-order question emphasizes structural insight over brute force. Notice $b_n = a_{n+1}$. Both derive from $f(x) = \frac{x}{x+1}$. Analyzing f&#039;(x) = \frac{1}{(x+1)^2} > 0 proves both are strictly increasing instantly. Moreover, recognizing $b_n$ as a shifted version of $a_n$ explains why their monotonic behavior is identical. This functional perspective unifies seemingly distinct sequences and reduces redundant calculation.

📖 Explanation: This question exposes a common oversight in checking boundary conditions. At $n=1$, $\frac{2}{1+1} = 1$, so $a_2 = a_1$. Strict decrease requires $< 1$, which only holds for $n > 1$. Thus, the sequence is non-increasing from $n=1$ but strictly decreasing only from $n=2$. Precision in inequalities is critical; 'decreasing' vs 'strictly decreasing' and starting indices matter significantly in rigorous analysis.

📖 Explanation: This scenario connects mathematical properties to physical intuition. Unlike rational functions where monotonicity depends on competing growth rates, pure exponentials $b^x$ with $0<b<1$ are monotone by definition. The derivative f&#039;(x) = -k f(x) maintains constant sign because $f(x) > 0$. This contrasts sharply with sequences like $\frac{n}{e^n}$ where initial behavior might differ. Recognizing inherent monotonicity saves effort in applied contexts.

📖 Explanation: This advanced problem uses integral representations to test conceptual depth. Since $0 \leq x \leq 1$, we have $x^{n+1} \leq x^n$. Multiplying by non-negative $\sin(\pi x)$ preserves the inequality: $x^{n+1}\sin(\pi x) \leq x^n \sin(\pi x)$. Integration preserves order, so $a_{n+1} \leq a_n$. Strict inequality holds because the functions differ on a set of positive measure. This avoids messy integration by parts, leveraging order properties instead.

📖 Explanation: This visual reasoning question warns against over-interpreting sparse data. Even if plotted points suggest a smooth decreasing trend, the underlying function connecting them could wiggle between integers. Monotonicity of $\{a_n\}$ depends only on values at integers, but inferring this from a sketched curve assumes regularity not guaranteed by discrete samples. Conversely, if the *function* is known to be decreasing, then yes—but the graph alone of points doesn't prove the function's behavior between samples.

📖 Explanation: This comparative analysis evaluates strategic tool selection. Subtraction yields $\frac{(n+1)^2+3(n+1)}{2^{n+1}} - \frac{n^2+3n}{2^n}$, requiring common denominators and messy algebra. Division gives $\frac{(n+1)^2+3(n+1)}{2(n^2+3n)}$, where the exponential simplifies to $1/2$. Comparing this rational function to 1 is far simpler. Recognizing when multiplicative structure favors ratios over differences is a key problem-solving skill in sequence analysis.

📖 Explanation: This fundamental concept reinforces the link between continuous derivatives and discrete monotonicity. By the Mean Value Theorem, f(n+1) - f(n) = f&#039;(c) for some $c \in (n, n+1)$. Since f&#039;(c) > 0, the difference is positive, implying strict increase. Note that increase does not imply convergence or boundedness (e.g., $f(x)=x$). This distinguishes monotonicity from convergence, a critical conceptual boundary.

📖 Explanation: This question dismantles a pervasive misconception about products. While $|a_n| \leq 1/n$ ensures convergence to 0, the sign changes of $\sin n$ cause $a_n$ to alternate between positive and negative values irregularly. Monotonicity requires consistent ordering, which oscillation destroys. Decay controls magnitude, not direction. Students must separate absolute convergence from monotonic behavior, especially with trigonometric factors.

📖 Explanation: This modeling question addresses practical nuances in iterative algorithms (Newton's method for square roots). If $a_1 < \sqrt{S}$, then $a_2 > \sqrt{S}$, and subsequent terms decrease toward $\sqrt{S}$. If $a_1 > \sqrt{S}$, terms decrease immediately. Thus, monotonicity (specifically decrease) is guaranteed only after the first correction step brings the estimate to the correct side. This 'eventual' nature is intrinsic to self-correcting algorithms.

📖 Explanation: This tests understanding of functional composition. If $f$ is strictly increasing, then $a_n < a_{n+1} \iff f(a_n) < f(a_{n+1})$, preserving order. Reciprocals reverse order (increasing becomes decreasing). Alternating signs or additions destroy order preservation. This principle allows transforming complex sequences into simpler ones (e.g., taking logs) while maintaining monotonic structure, a powerful technique in analysis.

📖 Explanation: This combines algebraic manipulation with behavioral analysis. Rationalizing gives $a_n = \frac{-n}{n+\sqrt{n^2+n}} = \frac{-1}{1+\sqrt{1+1/n}}$. As $n$ increases, $\sqrt{1+1/n}$ decreases, so the denominator decreases, making the fraction (which is negative) increase toward -0.5. The student's conclusion is right, but 'both grow' is insufficient reasoning; precise analysis of the composite function's direction is needed. This highlights that correct answers with flawed reasoning still represent conceptual gaps.

📖 Explanation: This applies monotonicity to nonlinear dynamics. Logistic maps exhibit complex behavior: for $1<r<3$, the equilibrium is stable, but convergence is monotone only within a basin of attraction. Outside this region, damped oscillations occur before settling. Thus, eventual monotonicity depends critically on initial conditions relative to the fixed point. This contrasts with linear recurrences where monotonicity is parameter-dependent but initial-condition-independent, illustrating richness in biological models.

📖 Explanation: This clarifies limitations of asymptotic tests. $\frac{a_{n+1}}{a_n} = \frac{n+2}{n+1} \cdot \frac{n}{n+1} = \frac{n^2+2n}{n^2+2n+1} < 1$. While true, simply noting the limit is 1 doesn't prove the inequality; one must examine the exact expression. Students sometimes mistakenly think 'limit < 1' is required for monotonicity, but for sequences (unlike series convergence), we need the exact ratio < 1 for each n, not just asymptotically.

📖 Explanation: This reinforces definitional understanding. Since each added term $\frac{1}{(n+1)^2} > 0$, we have $s_{n+1} = s_n + \text{positive}$, guaranteeing strict increase. No derivative, ratio, or difference analysis is needed. This distinguishes partial sum sequences from general sequences, highlighting how structural context (being a cumulative sum of positives) trivializes monotonicity testing—a key efficiency in series analysis.

📖 Explanation: This interprets derivative sign changes in discrete sampling. $a_2 = f(2)$, $a_3 = f(3)$. Since f&#039; < 0 on (2,3), $a_3 < a_2$. For $n \geq 3$, f&#039; > 0 implies $a_{n+1} > a_n$. Thus, the sequence decreases once then increases forever. It is not monotone globally (due to the drop at n=2→3) but is eventually increasing. This captures nuanced behavior where continuous extrema fall between integers.

📖 Explanation: This focuses on mechanistic proof construction. Induction for monotonicity requires propagating the ordering relation. The ratio $\frac{a_{k+1}}{a_k} = \frac{k+1}{2k}$ is < 1 iff $k+1 < 2k \iff k > 1$. Thus, the inductive step holds for $k \geq 2$, establishing eventual decrease from $n=2$. Base cases must be checked separately. This contrasts with direct methods and shows how induction encodes the 'eventual' threshold explicitly.

📖 Explanation: This clarifies categorical distinctions. Monotonicity is a property of the sequence $\{a_n\}$ itself (ordering). Series convergence concerns $\{s_n\}$ or conditions on $a_n$ (like limit zero). A series can converge with non-monotone terms (alternating series), and a monotone sequence can diverge ($a_n = n$). Confusing these leads to misapplying tests (e.g., using integral test to check if $a_n$ decreases rather than if $\sum a_n$ converges).

📖 Explanation: This evaluates computational feasibility. $a_{n+1} - a_n = \frac{\ln(n+2)}{\ln(n+1)} - \frac{\ln(n+1)}{\ln n}$. Common denominator yields a numerator involving products of logs, resistant to simplification. Conversely, $f(x) = \frac{\ln(x+1)}{\ln x}$ has a derivative whose sign analysis, while nontrivial, uses standard calculus tools (quotient rule, log properties) more systematically than discrete algebra. Choosing the right tool avoids algebraic quagmires.

📖 Explanation: This addresses sampling bias. Global monotonicity indeed requires consistency from the start, so early violations disprove it. However, the student's implicit assumption that four terms reveal *all* behavior is risky for eventual monotonicity. But for strict/global monotonicity, a single counterexample suffices. The nuance lies in what property is being tested. If the question was 'is it monotone?', four terms suffice to say no. If 'eventually monotone?', more analysis is needed.

📖 Explanation: This connects mathematical rigor to physical principles. While $S_n \to \infty$ correctly, the $(-1)^n/n$ term causes local decreases ($S_{n+1} < S_n$ for some n), violating the Second Law's requirement of non-decreasing entropy at every step. Mathematical models must satisfy qualitative constraints (monotonicity) beyond quantitative limits. This illustrates why 'eventually' isn't always acceptable in physics—local violations can be unphysical even if asymptotics match.

📖 Explanation: This elite-level problem uses classical inequalities. Consider $n+1$ numbers: $n$ copies of $(1+1/n)$ and one 1. Their arithmetic mean is $\frac{n(1+1/n)+1}{n+1} = \frac{n+2}{n+1} = 1 + \frac{1}{n+1}$. Geometric mean is $\left((1+1/n)^n \cdot 1\right)^{1/(n+1)} = a_n^{1/(n+1)}$. AM-GM gives $1+\frac{1}{n+1} > a_n^{1/(n+1)}$, so $a_{n+1} > a_n$. This elegant proof avoids derivatives entirely, showcasing deep inequality mastery.

📖 Explanation: This synthesizes multiple calculus concepts. Decreasing (f&#039;<0) establishes monotonicity. Convexity (f&#039;&#039;>0) describes the *shape* of that decrease (decelerating). It doesn't change the direction but informs approximation quality and convergence rates. Students often conflate curvature with direction; this question separates them. Convex decreasing sequences appear in optimization and economics, where diminishing returns matter alongside monotonic trends.