Scribd Logo
Upload

Welcome to Scribd!

  • 19 views

    Solutions For Week 3: N I 0 I n+1 K I 0 I k+1 k+1 I 0 I (k+1) +1 k+1 I 0 I k+2

    Uploaded by

    Pi
    This document contains solutions to mathematical problems involving sets, logic, and proofs using induction. It includes: 1) A proof by induction that the sum of terms in a geometric progression can be expressed as a closed form involving the common ratio and first term. 2) Examples analyzing the number of elements in sets containing the empty set. 3) Properties of intervals and relationships between intervals. 4) Analyzing set relationships like equality, subset, and intersection. 5) Classifying statements about integers and sets as true or false.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Solutions For Week 3: N I 0 I n+1 K I 0 I k+1 k+1 I 0 I (k+1) +1 k+1 I 0 I k+2

    Uploaded by

    Pi
    19 views2 pages
    This document contains solutions to mathematical problems involving sets, logic, and proofs using induction. It includes: 1) A proof by induction that the sum of terms in a geometric progression can be expressed as a closed form involving the common ratio and first term. 2) Examples analyzing the number of elements in sets containing the empty set. 3) Properties of intervals and relationships between intervals. 4) Analyzing set relationships like equality, subset, and intersection. 5) Classifying statements about integers and sets as true or false.

    Original Description:

    10101sols2

    Original Title

    10101sols2

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains solutions to mathematical problems involving sets, logic, and proofs using induction. It includes: 1) A proof by induction that the sum of terms in a geometric progression can be expressed as a closed form involving the common ratio and first term. 2) Examples analyzing the number of elements in sets containing the empty set. 3) Properties of intervals and relationships between intervals. 4) Analyzing set relationships like equality, subset, and intersection. 5) Classifying statements about integers and sets as true or false.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    19 views2 pages

    Solutions For Week 3: N I 0 I n+1 K I 0 I k+1 k+1 I 0 I (k+1) +1 k+1 I 0 I k+2

    Uploaded by

    Pi
    This document contains solutions to mathematical problems involving sets, logic, and proofs using induction. It includes: 1) A proof by induction that the sum of terms in a geometric progression can be expressed as a closed form involving the common ratio and first term. 2) Examples analyzing the number of elements in sets containing the empty set. 3) Properties of intervals and relationships between intervals. 4) Analyzing set relationships like equality, subset, and intersection. 5) Classifying statements about integers and sets as true or false.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    Solutions for week 3

    6.
    P In this case the statement P (n) to be proved for all integers n 0 is that
    n
    i=0 ai = (1 an+1 )/(1 a).
    Thus P (k) states that ki=0 ai = (1 ak+1 )/(1 a), and P (k + 1) states that
    P
    Pk+1 i (k+1)+1
    )/(1 a) or, simplifying, k+1 i k+2
    P
    i=0 a = (1 a i=0 a = (1 a )/(1 a).
    Proof We use induction P on n.
    Base case: For n = 0, ni=0 ai = a0 = 1 and (1an+1 )/(1a) = (1a)/(1a) = 1
    and so the result holds.
    Inductive step: Suppose as inductive hypothesis that ki=0 ai = (1ak+1 )/(1a)
    P

    for some k 0. Then k+1 i


    Pk i k+1
    = (1 ak+1 )/(1 a) + ak+1 (by
    P
    i=0 a = i=0 a + a
    k+1 k+1
    inductive hypothesis) = (1 a +a a )/(1 a) = (1 ak+2 )/(1 a) as
    k+2

    required.
    Conclusion: Hence ni=0 ai = (1 an+1 )/(1 a) for all n 0.
    P
    
    [This sum is known as a geometric progression with ratio a.]

    7. (i) The empty set has 0 elements. (ii) The set containing has 1 element
    (namely the empty set!) (iii) The set containing and {} has 2 elements, because
    and {} are different. (iv) The set given by listing any element twice contains
    only that element; so {, } is the same set as {}, and contains one element.

    8. (i) 0 6< 0, so 0 6 (0, 1); and 0 0 1, so 0 [0, 1]; and 0 0 < 1 so


    0 [0, 1); and 0 6< 0, so 0 6 (0, 1].
    (ii) [a, b] \ (a, b) = {a, b} when a b, and = otherwise.
    (iii) Since (a, b) = is a non-existence statement, it is hard to work with it di-
    rectly. So we prove this result by proving the equivalent contrapositive statement:

    (a, b) 6= a < b.

    : Suppose that (a, b) 6= . Then we may choose an element x (a, b). This
    means that a < x and x < b which implies that a < b.
    : Suppose that a < b. Then 2a < a + b < 2b so that a < (a + b)/2 < b which
    means that (a + b)/2 (a, b) so that (a, b) 6= .
    The equivalent statements for the other intervals are:

    [a, b] = a > b;
    [a, b) = a b;
    (a, b] = a b.

    1
    (iv) Suppose that [a, b] (c, d). Then since a [a, b] we must have a (c, d) and
    so in particular c < a. Similarly b [a, b] b (c, d) b < d.
    Conversely, if c < a and b < d then x [a, b] a x b c < x < d x
    (c, d) and so [a, b] (c, d).

    9. (i) Suppose that C = C D. Then x C x C D, so x D; thus


    C D. On the other hand, suppose that C D. Then x C x D, so
    x C D; and by definition, x C D x C. Thus x C x C D,
    and C = C D as required.
    (ii) Suppose that x C (C D). Then x C, and x C or x D; so x C.
    Thus x C (C D) x C, so C (C D) C. On the other hand,
    x C implies that x C and x C D; so x C x C (C D). Hence
    C C (C D), and C = C (C D), as required.
    There are many other valid solutions, some of which do not mention elements
    x; but it is not acceptable just to draw a Venn diagram!

    10. (i) False: a counterexample is m = 2, n = 1.


    (ii) True: an example is m = n = 1.
    (iii) True: choose n = m.
    (iv) True: choose m = 1.
    (v) True: choose m = n.
    (vi) False: a counterexample is m = n + 1 for any integer n.

    You might also like