Skip to content
START WITH A QUESTION

What would you like to understand?

Find an answer. See the moment it becomes clear. Follow the idea further.

← Concept directory

Answers for “这个例子证明数列是非递减的还是非递增的?”

3 keyword matches

Understanding your question. You can explore the search results below now.

Meet the concept

↗

The example proves the sequence is non-increasing. The mathematical derivation shows an+1−an≤0a_{n+1}-a_n \le 0, which implies an+1≤ana_{n+1} \le a_n.

Conditions: The sequence is defined by an+1=13(an+1)a_{n+1}=\frac{1}{3}(a_n+1) with a1=1a_1=1.; The lower bound an≥12a_n \ge \frac{1}{2} has been proven.

Find a method

↗

Subtract ana_n from both sides of the recurrence relation. Distribute the 13\frac{1}{3} and combine like terms to simplify the expression to −23an+13-\frac{2}{3}a_n + \frac{1}{3}.

Conditions: The recurrence relation is an+1=13(an+1)a_{n+1}=\frac{1}{3}(a_n+1).; The goal is to analyze the sign of the difference to determine monotonicity.

Understand why

↗

The inequality −23an+13≤0-\frac{2}{3}a_n+\frac{1}{3}\le0 is algebraically equivalent to 13≤23an\frac{1}{3}\le\frac{2}{3}a_n, which simplifies to 12≤an\frac{1}{2}\le a_n. Since the lower bound an≥12a_n\ge\frac{1}{2} was already proven by induction, the difference an+1−ana_{n+1}-a_n is guaranteed to be non-positive.

Conditions: The expression for the difference is an+1−an=−23an+13a_{n+1}-a_n = -\frac{2}{3}a_n + \frac{1}{3}.; The lower bound an≥12a_n \ge \frac{1}{2} has been established for all n≥1n \ge 1.