Scribd Logo
Upload

Welcome to Scribd!

  • 18 views

    COS 341: Discrete Mathematics

    Uploaded by

    f20221182
    This document provides the instructions for Homework #1 for the course COS 341: Discrete Mathematics. It includes 5 problems related to discrete mathematics topics like induction, sequences, and the game of chomp. Students are asked to find closed form expressions, use induction to prove statements, analyze sequences, devise winning strategies for the game of chomp, and prove that the natural numbers are well-ordered. The homework is due on Friday, September 29.

    Copyright:

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

    COS 341: Discrete Mathematics

    Uploaded by

    f20221182
    18 views2 pages
    This document provides the instructions for Homework #1 for the course COS 341: Discrete Mathematics. It includes 5 problems related to discrete mathematics topics like induction, sequences, and the game of chomp. Students are asked to find closed form expressions, use induction to prove statements, analyze sequences, devise winning strategies for the game of chomp, and prove that the natural numbers are well-ordered. The homework is due on Friday, September 29.

    Original Description:

    useful

    Original Title

    hw

    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 provides the instructions for Homework #1 for the course COS 341: Discrete Mathematics. It includes 5 problems related to discrete mathematics topics like induction, sequences, and the game of chomp. Students are asked to find closed form expressions, use induction to prove statements, analyze sequences, devise winning strategies for the game of chomp, and prove that the natural numbers are well-ordered. The homework is due on Friday, September 29.

    Copyright:

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

    COS 341: Discrete Mathematics

    Uploaded by

    f20221182
    This document provides the instructions for Homework #1 for the course COS 341: Discrete Mathematics. It includes 5 problems related to discrete mathematics topics like induction, sequences, and the game of chomp. Students are asked to find closed form expressions, use induction to prove statements, analyze sequences, devise winning strategies for the game of chomp, and prove that the natural numbers are well-ordered. The homework is due on Friday, September 29.

    Copyright:

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

    COS 341: Discrete Mathematics

    Homework #1 Fall 2006


    Induction Due: Friday, September 29

    See instructions on the “assignments” web-page on how and when to turn in homework,
    and be sure to read the collaboration and late policy for this course. Approximate point
    values are given in parentheses.

    1. (10) Find a closed form expression for


    X
    n
    1
    .
    i=1
    i(i + 1)

    Be sure to prove your answer.

    2. (10) Use induction (or strong induction) to prove that it is possible using only 4-cent
    and 7-cent stamps to form exact postage of n cents for any n ≥ 18.

    3. (10) Consider the sequence of numbers X0 , X1 , X2 , . . . defined as follows:


    X0 = 0
    X1 = 1
    3
    Xn = 5Xn−1 + 7Xn−2 for n ≥ 2.
    Prove that if n is a multiple of 3, then Xn is even.

    4. (10) The game of chomp is played on an m × n grid between two players, Alice and
    Bob, with Alice going first. Initially the grid is filled with cookies, as shown in the left
    figure below, in this case, on a 4 × 5 grid. The top left cookie is poison, and whoever eats
    it, loses the game. The players take turns eating cookies, and at least one of the remaining
    cookies must be eaten on every turn. A player can choose to eat any remaining cookie, but
    doing so causes all of the remaining cookies below or to the right of the chosen cookie to
    also be eaten. For instance, in the center figure below, Alice has eaten the cookie in the
    blackened square, causing the five cookies below or to its right also to be eaten. Similarly,
    in the right figure, Bob has eaten the cookie in the blackened square of that figure, causing
    the three remaining cookies below or to its right also to be eaten.
      

    
     
      
    

    
      

      

    Suppose the game is played on a 2 × n grid (that is, with two rows and n columns),
    where n ≥ 1. Find a winning strategy for Alice. In other words, show how Alice can play
    in such a way that she is guaranteed to win. Be sure to prove that your strategy always
    causes Alice to win, regardless of how Bob plays.
    5. (10) Use induction to prove that the natural numbers are well ordered. That is, use
    induction (or strong induction) to show that for any subset S of N, if S is non-empty, then
    S has a least element. Or equivalently, you can prove the contrapositive of this statement,
    namely, that if S does not have a least element, then S is empty.
    (We say that x is a least element of a set S if x ∈ S and if x ≤ y for every y ∈ S. Not
    all sets have least elements, for instance, the set of all negative integers, or the set of all
    (strictly) positive real numbers.)

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy