Workshop Exercises 2.

  1. 1.

    For any n>1, let an=1log2⁡(n) (also, let a1=1). Show that an→0, by finding for any ε>0 an explicite value of Nε such that if n≥Nε then an≤ε.

  2. 2.

    Give an example of two non-convergent sequences of positive real numbers {an}n=1∞ and {bn}n=1∞ so that the sequence {an⁢bn}n=1∞ is convergent.

  3. 3.

    Somebody came up with the definition of a Dauchy-sequence: A sequence of real numbers {an}n=1∞ is a Dauchy-sequence if

    ∃ε>0⁢∃N>0 such that if n,m≥N then |an-am|≤ε.

    • –

      Show that all Cauchy-sequences are Dauchy, but some Dauchy-sequences are not Cauchy-sequences.

    • –

      Show that all Dauchy-sequences are bounded.

    • –

      Show that all bounded sequences are, in fact, Dauchy-sequences.

  4. 4.

    In this problem we have infinitely many sequences:

    The first sequence is: {xn1}n=1∞. The second sequence is {xn2}n=1∞ and the 1000-th sequence is {xn1000}n=1∞. So, in general, the k-th sequence is {xnk}n=1∞.

    • –

      Is it true that if ALL the sequences above are bounded, then the sequence {xkk}k=1∞ is bounded as well?

    • –

      Is it true that if ALL the sequences above are converging to 0, then the sequence {xkk}k=1∞ is converging to 0 as well?

    • –

      Suppose that the following statement holds:

      For any k≥1 and n≥1: |xnk|<1k.

      Show that xkk→0.

    • –

      (somewhat harder problem) Suppose that ALL the sequences are converging to 0. Show that for any k≥1, you can pick an element xikk from the k-th sequence such that xikk→0.  (there is another problem on the next page!!!)

    • –

      (a bit of a challenge) Let f:ℕ→ℕ a bijective map. These sorts of functions are called permutations of the natural numbers. Let limn→∞⁡an=a. Show that limn→∞⁡af⁢(n)=a. The sequence {af⁢(n)}n=1∞ is called a rearrangement of the sequence {an}n=1∞.