(b) Theorem: Assume {a} is a sequence which converges to a and (b) is a sequence which converges to b, then the sequence
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
(b) Theorem: Assume {a} is a sequence which converges to a and (b) is a sequence which converges to b, then the sequence
(b) Theorem: Assume {a} is a sequence which converges to a and (b) is a sequence which converges to b, then the sequence {an + b} converges to a + b. Proof: Let > 0 be given. (1) Then there exists N₁ EN such that lan -a <for all n > N₁. (2) (3) and there exists N₂ € N such that bn - b < for all n > N₂. Let N= max(N₁, N₂}. Thus an + bn(a+b)| <e for all n ≥ N. (5) (i) Explain why (2) and (3) are true. (ii) Explain why (5) is true. (iii) Why does (5) prove the theorem? [12 marks]
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!