Sign in

Libre University uses your GitHub account. Signing in is only needed to sit a final test, so the score is kept on your profile.

Limits, proved

1.[2p]

Put the lines of the proof that 2n+3n+1→2 in order.

  1. Since ε was arbitrary, an→2.

  2. Let ε>0.

  3. Then |an−2|=1n+1<1n≤1N<ε.

  4. By the Archimedean property there is N∈ℕ with N>1ε.

  5. Let n≥N.

Show the answer

a, b, c, d, e

2.[2p]

For an=3n+1n+2 and L=3, what is the smallest N such that |an−3|<0.01 for every n≥N?

CorrectNot quite: 499

3.[1p]

For an=1n and L=0, what is the smallest N such that |an|<0.003 for every n≥N?

CorrectNot quite: 334

4.[1p]

In the proof that 1n→0, which step needs the Archimedean property?

Correct

The answer is: Finding a natural number N with N>1ε

The answer is: Finding a natural number N with N>1ε

The answer is: Finding a natural number N with N>1ε

5.[2p]

A proof that 3n+1n+2→3 says "take N=5ε". What would a careful reader object to?

Correct

The answer is: 5ε is usually not a natural number, so it cannot serve as N

The answer is: 5ε is usually not a natural number, so it cannot serve as N

The answer is: 5ε is usually not a natural number, so it cannot serve as N

6.[2p]

Which of these are correct about proving that (−1)n diverges?

Select all that apply

Correct
Correct
Correct

The answer is: The proof must show the sequence converges to no real number L, so it starts with an arbitrary L, The prover chooses the tolerance, here ε=1, For each N, one of the terms at positions 2N and 2N+1 lies at least 1 from L

The answer is: The proof must show the sequence converges to no real number L, so it starts with an arbitrary L, The prover chooses the tolerance, here ε=1, For each N, one of the terms at positions 2N and 2N+1 lies at least 1 from L

7.[3p]

Match each theorem to the move its proof turns on.

  • Uniqueness of limits

  • Limit of a sum

  • Convergent sequences are bounded

  • Monotone convergence

  • the tolerance |L−M|2 and a contradiction

  • the supremum of the terms, from completeness

  • tolerance 1 and the finitely many earlier terms

  • tolerance ε2 for each sequence

Show the answer

Uniqueness of limits: the tolerance |L−M|2 and a contradiction Limit of a sum: tolerance ε2 for each sequence Convergent sequences are bounded: tolerance 1 and the finitely many earlier terms Monotone convergence: the supremum of the terms, from completeness

8.[1p]

Every bounded sequence of real numbers converges.

The answer is: False

Correct

9.[3p]

Which of these are true of the decimal truncations 1,1.4,1.41,1.414,… of 2?

Select all that apply

Correct
Correct
Correct
Correct

The answer is: Every term is rational and the sequence is increasing and bounded above, In ℝ the sequence converges to 2, In ℚ the sequence has no limit, In ℚ the proof of monotone convergence breaks where it takes a supremum

10.[3p]

Which of these conclusions follow from the algebra of limits, given only that an→2 and bn→0?

Select all that apply

Correct
Correct
Correct

The answer is: an+bn→2, anbn→0, bnan→0, 3an−bn→6

Correct

11.[2p]

To prove (−1)nn→0 by the squeeze theorem, which pair of bounding sequences works?

Correct

The answer is: −1n≤(−1)nn≤1n

The answer is: −1n≤(−1)nn≤1n

The answer is: −1n≤(−1)nn≤1n

12.[1p]

Every bounded sequence of real numbers has a convergent subsequence.

Correct

The answer is: True

13.[2p]

In proving that f(x)=3x−1 is continuous at a=2, what is the largest δ that works for ε=0.3?

CorrectNot quite: 0.1

14.[2p]

Why is H(x)=0 for x<0, H(x)=1 for x≥0 not continuous at 0?

Correct

The answer is: With ε=12, every δ>0 is defeated by x=−δ2

The answer is: With ε=12, every δ>0 is defeated by x=−δ2

The answer is: With ε=12, every δ>0 is defeated by x=−δ2