Scribd Logo
Upload

Welcome to Scribd!

  • 23 views

    3333 HW1

    Uploaded by

    cody
    1. This homework assignment on mathematical induction is due on September 1, 2016. Students must show their work, and illegible homework may not be graded. 2. Homework should be submitted in class on the due date and cannot be submitted via email or to the math office. 3. The homework contains 9 problems involving proofs using mathematical induction or related techniques. Students are asked to prove identities, find sets of numbers satisfying conditions, and prove inequalities.

    Copyright:

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

    3333 HW1

    Uploaded by

    cody
    23 views9 pages
    1. This homework assignment on mathematical induction is due on September 1, 2016. Students must show their work, and illegible homework may not be graded. 2. Homework should be submitted in class on the due date and cannot be submitted via email or to the math office. 3. The homework contains 9 problems involving proofs using mathematical induction or related techniques. Students are asked to prove identities, find sets of numbers satisfying conditions, and prove inequalities.

    Original Description:

    Intermediate Analysis Homework 1

    Original Title

    3333_HW1

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1. This homework assignment on mathematical induction is due on September 1, 2016. Students must show their work, and illegible homework may not be graded. 2. Homework should be submitted in class on the due date and cannot be submitted via email or to the math office. 3. The homework contains 9 problems involving proofs using mathematical induction or related techniques. Students are asked to prove identities, find sets of numbers satisfying conditions, and prove inequalities.

    Copyright:

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

    3333 HW1

    Uploaded by

    cody
    1. This homework assignment on mathematical induction is due on September 1, 2016. Students must show their work, and illegible homework may not be graded. 2. Homework should be submitted in class on the due date and cannot be submitted via email or to the math office. 3. The homework contains 9 problems involving proofs using mathematical induction or related techniques. Students are asked to prove identities, find sets of numbers satisfying conditions, and prove inequalities.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 9

    Math 3333

    Homework 1
    Due: September 1, 2016

    Name:

    Peoplesoft ID:

    Show your work. If a problem requires a proof, explain and justify your steps carefully.
    Homework papers should be legible and neat, and the pages should be stapled together
    in the correct order. Illegible work may not be graded.
    Homework should be submitted in class on the indicated due date. Submissions by
    email or to the math office will not be accepted.

    1. Use mathematical induction to prove that


    12 + 22 + 32 + + n2 =

    n(n + 1)(2n + 1)
    6

    2. Use mathematical induction to prove that


    13 + 23 + 33 + + n3 = (1 + 2 + 3 + + n)2

    3. For what integers n is 32n+1 + 2n+2 divisible by 7? Prove that your answer
    is correct. (Hint: Use induction, and recall that an integer x is divisible by 7
    if and only if x = 7m for some integer m.)

    4. Let Pn be the proposition that


    1 + 2 + 3 + + n =

    (n + 2)(n 1)
    2

    Let S be the set of positive integers for which the proposition holds.
    (a) Show that if k S, then k + 1 S.
    (b) Is there an integer k S?

    Generalized induction: Let S be a subset of N. Suppose S has the


    following properties:
    (a) The positive integer m S, and
    (b) k S implies k + 1 S for each k m.
    Then S = {n N | n m}.
    5. For what integers n N is 2n n!? (Hint: Use the generalized version of
    mathematical induction.)


    6. Let S = {a + b 2 | a, b Q}.
    (a) Show that S with ordinary addition and multiplication is a field.
    (Hint: Since S is a subset of a field, it suffices to verify axioms A1, A4,
    A5, M1, M4, and M5).

    (b) What is the multiplicative inverse of 2 5 2? Express your answer in

    the form a + b 2.

    7. Prove that for any set of n real numbers, x1 , x2 , , xn ,


    |x1 + x2 + xn | |x1 | + |x2 | + + |xn |
    (Hint: Use induction.)

    8. Prove: If x 0 and x  for every  > 0, then x = 0.


    (Hint: Assume, for the sake of contradiction, that x > 0, and consider  = x2 .)



    9. Prove: |x| |y| |x y| for any two real numbers x, y.
    (Hint: You need to prove |x| |y| |x y| and |x| |y| |x y|. Use the
    triangle inequality.)

    You might also like