📝 Monotone sequences increasing decreasing (31 MCQs)

📖 Explanation: Monotonicity of a sequence $a_n = f(n)$ cannot be determined solely by inspecting the numerator or denominator in isolation. Even if the numerator grows quadratically, the denominator also increases, potentially causing the overall fraction to decrease initially before increasing. A rigorous analysis requires examining $a_{n+1} - a_n$ or f'(x) for the complete function. The quadratic numerator has a minimum at $n=5$, but the rational function’s behavior is more complex due to the linear denominator.

📖 Explanation: While multiple methods can work, the AM-GM approach elegantly proves strict increase without calculus or advanced inequalities. Applying AM-GM to the $n+1$ numbers $1, 1+\frac{1}{n}, \dots, 1+\frac{1}{n}$ (with one 1 and n copies of $1+1/n$) yields $a_{n+1}^{1/(n+1)} > a_n^{1/n}$, implying $a_{n+1} > a_n$. This avoids pitfalls of asymptotic approximations and provides a self-contained algebraic proof suitable for Olympiad-level reasoning.

📖 Explanation: For logistic maps with $r > 2$, the fixed point becomes unstable and periodic or chaotic behavior emerges. At $r = 2.5$, the system exhibits stable 2-cycle oscillations around the equilibrium $K(1 - 1/r) = 600$. Starting at $P_1 = 800$, the sequence will alternate above and below 600 without settling into monotonic behavior. Thus, it is never eventually monotone, illustrating how nonlinear recurrence relations can violate intuitive expectations from continuous models.

📖 Explanation: Since $f$ is decreasing, $a_n > a_{n+1}$, so the sequence is strictly decreasing. Concavity up means f' is increasing (less negative), so the slope becomes less steep. Thus, the drop f(n) - f(n+1) \approx -f'(c) for $c \in (n, n+1)$ decreases as $n$ increases because f' is rising toward zero. Therefore, the successive differences $a_n - a_{n+1}$ themselves form a strictly decreasing positive sequence, reflecting diminishing decrements.

📖 Explanation: A sequence is eventually strictly monotone only if, after some index, every consecutive pair satisfies strict inequality. Option B equals 1 at every even index and exceeds 1 at odd indices, so $a_{2k} = a_{2k+2} = 1$, violating strictness infinitely often. Yet it is nonincreasing overall since odd terms exceed 1 and even terms equal 1, making it monotone (nonincreasing) but never strictly so beyond any point. Other options either fail monotonicity entirely or become strictly monotone.

📖 Explanation: The claim that $\sqrt{2+x} > x$ for all $x > 0$ is false; solving $\sqrt{2+x} > x$ gives $x < 2$ (since squaring yields $x^2 - x - 2 < 0$). At $x = 2$, equality holds, and for $x > 2$, the inequality reverses. Since $a_1 = 2$, we get $a_2 = \sqrt{4} = 2$, so the sequence is actually constant, not increasing. The student’s universal quantifier was incorrect, highlighting the danger of unverified functional inequalities in recursive definitions.

📖 Explanation: On the open interval $(0,1)$, we have $0 < x < 1$, so $x^{n+1} < x^n$. Multiplying both sides by the positive function $e^x$ preserves the inequality: $x^{n+1}e^x < x^n e^x$. Integrating over [0,1] maintains strict inequality since the integrands differ on a set of positive measure. Hence $a_{n+1} < a_n$ for all $n$, proving strict decrease. This application leverages pointwise dominance and integral monotonicity without computation.

📖 Explanation: The condition $a_{n+2} > a_n$ implies that every other term increases, so both the even-indexed and odd-indexed subsequences are strictly increasing. However, the full sequence need not be monotone; for example, $a_n = n + (-1)^n$ satisfies $a_{n+2} > a_n$ but alternates in local behavior. It may still converge if bounded, or diverge, but no global monotonicity or divergence is guaranteed. Only the subsequence structure is enforced by the given recurrence inequality.

📖 Explanation: The sequence $a_{n+1} = \cos(a_n)$ with $a_1 = 1$ is bounded in [0,1] and eventually monotone (it alternates then settles), converging to the unique fixed point of $\cos x = x$. However, this Dottie number has no closed-form expression in elementary functions, unlike the other options which converge to known constants (1, $\pi^2/6$, e). This exemplifies how monotone convergence guarantees existence without providing computability, a key conceptual distinction in analysis.

📖 Explanation: Even though f&#039;(n) = 0 at integers, the integral of f&#039; over [n, n+1] remains positive since f&#039; > 0 on (n, n+1). By the Fundamental Theorem, a_{n+1} - a_n = \int_n^{n+1} f&#039;(x) dx > 0, so the sequence is strictly increasing. Derivative values at isolated points don’t control discrete differences; only the integral matters. This counters the misconception that vanishing derivative at sample points precludes sequence growth, emphasizing the distinction between pointwise and aggregate behavior.

📖 Explanation: Since $|\sin(n)| \leq 1$, we have $r_n \geq 0.05 - 0.01 = 0.04 > 0$ for all n. Thus $1 + r_n > 1$, and with positive initial balance $B_1 > 0$, each multiplication increases the balance: $B_{n+1} > B_n$. Despite rate fluctuations, positivity of $r_n$ ensures strict monotonic increase. This applies financial intuition within mathematical rigor, showing that bounded oscillation in growth rate doesn’t violate monotonicity if the rate stays positive.

📖 Explanation: The sequence $a_n = 1 + \sin(\ln n)/n$ is positive, and $a_{n+1}/a_n \to 1$ since the perturbation decays. However, $\sin(\ln n)$ oscillates infinitely often with decreasing amplitude but non-monotonic envelope, causing $a_n$ to increase and decrease indefinitely. Thus, it is never eventually monotone despite ratio tending to 1. This refutes the misconception that asymptotic ratio behavior controls eventual monotonicity, highlighting that higher-order fluctuations can persist even when first-order trends stabilize.

📖 Explanation: Define $c_n = b_n - a_n$. Since $b_n$ decreases and $a_n$ increases, $c_{n+1} = b_{n+1} - a_{n+1} < b_n - a_n = c_n$, so $\{c_n\}$ is strictly decreasing. Also $c_n > 0$ by hypothesis. Thus $\{c_n\}$ is a positive decreasing sequence. Convergence of individual sequences isn’t guaranteed without boundedness, and sum/difference monotonicity doesn’t extend to $a_n + b_n$. Only the gap’s monotonicity follows directly from the given conditions.

📖 Explanation: Eventual monotonicity depends only on tail behavior. Since f&#039;(x) > 0 for all $x > 10$, then for all integers $n \geq 11$, $f$ is increasing on [n, n+1], so $a_{n+1} = f(n+1) > f(n) = a_n$. Thus $\{a_n\}$ is strictly increasing for $n \geq 11$, satisfying eventual strict increase. Early behavior (n < 11) is irrelevant to eventual properties. The continuity ensures no pathological jumps, but even without it, positivity of derivative on an interval implies increase on that interval.

📖 Explanation: The sequence $a_n = H_n - \ln n$ is well-known to be strictly decreasing and bounded below (converging to Euler’s constant γ). Monotonicity follows from integral comparison: $\int_n^{n+1} 1/x dx < 1/n$, implying $\ln(n+1) - \ln n < 1/n$, so $a_{n+1} < a_n$. Boundedness comes from $H_n < 1 + \ln n$. Other options either diverge, oscillate, or fail monotonicity. This connects classic results to monotone-bounded principles.

📖 Explanation: Base case: $a_1 = 0 \in [0,1)$. Assume $0 \leq a_n < 1$. Then $1 - a_n > 0$, so $a_{n+1} - a_n = (1 - a_n)/n^2 > 0$, proving strict increase. Also $a_{n+1} = a_n + (1 - a_n)/n^2 < a_n + (1 - a_n) = 1$, so bounded above by 1. Induction completes the proof. This demonstrates how recursive structure with positive feedback toward a bound enforces monotonicity and boundedness simultaneously, a common technique in dynamical systems.

📖 Explanation: For a monotone sequence, convergence of any subsequence implies convergence of the whole sequence to the same limit. If increasing and a subsequence → L, then all terms beyond some point are ≤ L (if subseq terms approach L from below) or ≥ L, but monotonicity forces squeezing. Specifically, if increasing and $a_{k^2} \to L$, then for any n, choose k with $k^2 > n$, so $a_n \leq a_{k^2} \to L$, and since increasing, $a_n$ bounded above by L, hence converges to sup ≤ L; but subsequence hits arbitrarily close to L, so sup = L. Similar for decreasing. Thus full sequence → L.

📖 Explanation: After a shock (e.g., disaster reducing population), the sequence may initially fluctuate due to Allee effects or resource redistribution before settling into logistic growth, which is eventually monotone toward carrying capacity. Radioactive decay and Newtonian cooling are monotone from start; simple interest is linear. Only post-shock ecology exhibits transient non-monotonicity before asymptotic monotonic approach, matching the mathematical concept of eventual monotonicity in applied contexts.

📖 Explanation: On (0, π/2), 0 < sin x < 1, so $\sin^{n+1} x < \sin^n x$. At endpoints x=0 and x=π/2, equality holds (0 and 1 respectively), but these are measure-zero sets. Thus $\sin^{n+1} x \leq \sin^n x$ everywhere with strict inequality on a set of positive measure, implying $a_{n+1} < a_n$. Hence strictly decreasing. This applies measure-theoretic reasoning to avoid computation, leveraging pointwise dominance in integrals.

📖 Explanation: This exemplifies the danger of inductive reasoning from finite data. Apparent trends can reverse, as seen here at n=5. Monotonicity is a universal property requiring proof via difference, ratio, or derivative tests—not empirical observation. This reinforces foundational analysis principles against overreliance on computational experimentation, especially in modeling where late-stage bifurcations occur.

📖 Explanation: Define $f(x) = \ln x / x$. Then f&#039;(x) = (1 - \ln x)/x^2, which is negative when $\ln x > 1$, i.e., $x > e \approx 2.718$. Thus for integers $n \geq 3$, f&#039;(x) < 0 on [n, n+1], so $a_{n+1} < a_n$. At n=2: $a_2 = \ln2/2 ≈ 0.346$, $a_3 = \ln3/3 ≈ 0.366 > a_2$, so not decreasing at n=2. Hence strictly decreasing only for $n \geq 3$. This combines calculus with discrete indexing, noting threshold at e.

📖 Explanation: Given $|e_1| < 1$ and $k < 1$, we have $|e_2| \leq k |e_1|^2 < |e_1|^2 < |e_1|$. By induction, if $|e_n| < 1$, then $|e_{n+1}| \leq k |e_n|^2 < |e_n|$. Thus strictly decreasing. Quadratic convergence with contraction factor ensures monotonic error reduction once inside basin of attraction. This links numerical analysis to monotone sequences, showing how convergence order implies monotonicity under suitable initialization.

📖 Explanation: The Monotone Convergence Theorem states that a monotone sequence converges if and only if it is bounded. In contrast, boundedness alone doesn’t ensure convergence (e.g., $(-1)^n$). This distinction is fundamental: monotonicity provides directional control, while boundedness provides range control. Together they suffice; separately, only monotone+bnd ⇒ conv. This clarifies why both hypotheses are necessary in MCT and prevents conflating necessary vs sufficient conditions.

📖 Explanation: Write $a_{n+1} - a_n = \sum_{k=n+1}^{2n+2} \frac{1}{k} - \sum_{k=n}^{2n} \frac{1}{k} = \frac{1}{2n+1} + \frac{1}{2n+2} - \frac{1}{n}$. Simplify: $\frac{1}{2n+1} + \frac{1}{2n+2} < \frac{1}{2n} + \frac{1}{2n} = \frac{1}{n}$, so difference < 0. Thus strictly decreasing. This requires careful index manipulation and inequality estimation, showcasing advanced application of series comparison within sequence monotonicity analysis.

📖 Explanation: For $0 < r \leq 1$, the Ricker model is monotone convergent to K when starting below K. Here r=0.5<1, D1=50$f(D) = D e^{0.5(1-D/100)}$ satisfies f(D)>D for DD1, and by induction Dn increases toward K. This applies domain-specific knowledge of population models to monotonicity, linking biology to analysis.

📖 Explanation: Equal liminf and limsup imply convergence. For monotone sequences, this is equivalent to boundedness (by MCT). Convergent sequences are always Cauchy and bounded. Thus all statements hold. This integrates multiple concepts: monotonicity ties liminf/limsup equality to convergence, which entails boundedness and Cauchy property. Recognizing these equivalences demonstrates deep understanding of sequential compactness and completeness in reals.

📖 Explanation: An eventually strictly decreasing unbounded sequence must tend to $-\infty$, depicted as points falling indefinitely (e.g., $a_n = -n$ for n>N). Option A shows bounded decrease; C shows non-monotone; D shows bounded non-monotone. Only B matches unbounded eventual strict decrease. Interpreting graphical features against analytical definitions tests visual-literacy in sequence behavior.

📖 Explanation: The student isolates exponent decay but ignores competing base growth. Taking logs: $\ln a_n = (\ln n)/n$, whose derivative sign determines monotonicity. As shown earlier, this increases for ne. Thus sequence increases from n=1 to n=3 then decreases. All listed critiques are valid: simultaneous variation, log transformation necessity, and initial increase. Comprehensive error analysis requires acknowledging all facets.

📖 Explanation: Non-convex landscapes contain regions where gradient ascent occurs temporarily during escape from saddles or transitions between basins, causing $f(x_{n+1}) > f(x_n)$. Thus objective value sequence loses monotonicity. This connects optimization practice to sequence theory, showing how problem structure dictates monotonicity—a crucial consideration in algorithm design and convergence proofs.

📖 Explanation: Each factor $1 + 1/k^2 > 1$, so product strictly increases. Taking logs: $\ln a_n = \sum_{k=1}^n \ln(1 + 1/k^2) < \sum_{k=1}^n 1/k^2 < \pi^2/6$. Thus $a_n < e^{\pi^2/6}$, proving boundedness. This uses inequality $\ln(1+x) < x$ and known p-series sum, combining infinite products, series, and monotonicity in a sophisticated argument typical of advanced analysis.

📖 Explanation: If g is increasing and $a_2 = g(a_1) \geq a_1$, then by induction $a_{n+1} = g(a_n) \geq g(a_{n-1}) = a_n$, so increasing. Similarly for decreasing. Continuity, fixed points, or differentiability alone don’t guarantee monotonicity without ordering conditions. This synthesizes recursion, function properties, and induction—a mixed-concept insight vital for dynamical systems analysis.