0% found this document useful (0 votes)
7 views1 page

Engineering Mathematics I: Sequences Exercises

Tutorial

Uploaded by

princejha987654
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
7 views1 page

Engineering Mathematics I: Sequences Exercises

Tutorial

Uploaded by

princejha987654
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Indian Institute of Technology (BHU), Varanasi

Department of Mathematical Sciences


MA101 Engineering Mathematics I: Odd Semester 2024-25
Tutorial sheet 2: Sequences

Exercise 1: Let x ∈ R. Show that there exists a sequence of rational number {xn } such that lim xn = x.
Hint: Use density theorem of Q in R.

Exercise 2: Let {xn } be a sequence. Prove or disprove the following statements:

(i) If xn → 0 and {yn } is a bounded sequence, then xn yn → 0.


(ii) If xn → ∞ and {yn } is a bounded sequence, then xn yn → 0.

Hint: Use the definition of convergence of a sequence.

Exercise 3: Let {xn } be a sequence of positive real numbers. Prove or disprove the following statements:

(i) If xn+1 − xn → 0, then xn converges.


(ii) If |xn+2 − xn+1 | < |xn+1 − xn | for all n ∈ N, then {xn } converges.
(iii) If {xn } satisfies the Cauchy criterion, then there exists an α ∈ (0, 1) such that

|xn+2 − xn+1 | ≤ α|xn+1 − xn | for all n ∈ N.

Exercise 4: For any constant k, prove that


kn
lim = 0.
n→∞ n!

Hint: Use squeeze/sandwich theorem.

Exercise 5: Check the convergence of the following sequences:

1
(i) a1 = 1 and an+1 = an + .
5n
n2023
(ii) an = .
(2024)n
 
1
(iii) an = n sin
n

Exercise 6: Prove that every sequence of real numbers has a monotonic subsequence.

Common questions

Powered by AI

The Cauchy criterion states a sequence converges if for every ε > 0, there exists an N such that for all m, n > N, \(|x_m - x_n| < ε\). For \(|x_{n+2} - x_{n+1}| \leq \alpha |x_{n+1} - x_n|\) with \(\alpha < 1\), this condition reflects an exponentially decaying sequence of differences, ensuring that \(|x_n - x_m|\) for any terms \(x_n, x_m\), will become arbitrarily small as n increases. By the geometric sequence nature of the differences, the sequence satisfies the Cauchy criterion and thus converges .

To determine the converge of the given recursive sequence, consider the increments \(\frac{1}{5^n}\) which decrease rapidly since \(5^n\) grows exponentially. These form a geometric series with a ratio less than 1, ensuring their sum converges. Thus, the sequence itself converges as the partial sums \(a_n\) approach a fixed point given by the sum of the series \(1 + \sum_{n=1}^{\infty} \frac{1}{5^n}\), which is finite .

The terms \(a_n = n \sin(\frac{1}{n})\) can be approximated as \(\sin(\frac{1}{n}) \sim \frac{1}{n}\) for large n, since \(\sin x \approx x\) when x is close to zero. Thus, \(a_n \sim n \times \frac{1}{n} = 1\). Therefore, as \(n\) grows, the sequence approaches 1. Hence, the sequence converges to 1 .

The principle of Bolzano-Weierstrass theorem allows this conclusion. It states that every bounded sequence has a convergent subsequence, which must be monotonic in nature. By extension, every sequence, whether bounded or not, has an increasing or decreasing subsequence because we can always extract a monotonic subsequence by either choosing increasing differences or opting for a subsequence that repeatedly does not decrease .

The condition \(|x_{n+2} - x_{n+1}| < |x_{n+1} - x_n|\) implies that the differences between successive terms of the sequence are decreasing. Such behavior suggests the convergence of the sequence because the differences tending to zero imply that the sequence {x_n} satisfies the criteria for a Cauchy sequence. A Cauchy sequence, by definition, converges in real numbers since every Cauchy sequence in the real numbers is also convergent .

The squeeze theorem states that if \(a_n \leq b_n \leq c_n\) for all n, and \(\lim_{n \to \infty} a_n = \lim_{n \to \infty} c_n = L\), then \(\lim_{n \to \infty} b_n = L\). For \(\frac{k^n}{n!}\), as n grows, \(n!\) grows factorially fast compared to the exponential growth of \(k^n\), implying \(0 \leq \frac{k^n}{n!} \leq \frac{k^n}{n^n}\), and \(\lim_{n \to \infty} \frac{k^n}{n^n} = 0\). Hence, by the squeeze theorem, \(\lim_{n \to \infty} \frac{k^n}{n!} = 0\).

The density theorem states that between any two real numbers, there exists a rational number. This property implies that for any real number x, we can construct a sequence of rational numbers {x_n} such that each x_n is rational and lim x_n = x. By selecting successive rational approximations to x (e.g., via continued fractions or decimal expansions that terminate in rational forms), we leverage the density property to show that such a sequence indeed converges to x .

If {x_n} converges to zero, for every ε > 0, there exists an N such that for all n > N, |x_n| < ε/M where M is an upper bound for the bounded sequence {y_n}. Consequently, |x_n y_n| < ε for all n > N, which means {x_n y_n} converges to 0, by the definition of convergence .

You might also like