Scribd Logo
Upload

Welcome to Scribd!

  • 70 views

    Combinatorics Problem Set

    Uploaded by

    rkjadriano
    1) The number of bit strings of length n that have at least two ones can be summarized in one sentence. 2) This problem involving seating arrangements of couples at the movies can be summarized in three sentences addressing the four parts of the problem. 3) The problem involving distributing five rabbits among four pet stores so that no store gets both a parent and child can be summarized in one sentence stating the number of ways this can be done.

    Copyright:

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

    Combinatorics Problem Set

    Uploaded by

    rkjadriano
    70 views1 page
    1) The number of bit strings of length n that have at least two ones can be summarized in one sentence. 2) This problem involving seating arrangements of couples at the movies can be summarized in three sentences addressing the four parts of the problem. 3) The problem involving distributing five rabbits among four pet stores so that no store gets both a parent and child can be summarized in one sentence stating the number of ways this can be done.

    Original Description:

    ProbSet

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1) The number of bit strings of length n that have at least two ones can be summarized in one sentence. 2) This problem involving seating arrangements of couples at the movies can be summarized in three sentences addressing the four parts of the problem. 3) The problem involving distributing five rabbits among four pet stores so that no store gets both a parent and child can be summarized in one sentence stating the number of ways this can be done.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    70 views1 page

    Combinatorics Problem Set

    Uploaded by

    rkjadriano
    1) The number of bit strings of length n that have at least two ones can be summarized in one sentence. 2) This problem involving seating arrangements of couples at the movies can be summarized in three sentences addressing the four parts of the problem. 3) The problem involving distributing five rabbits among four pet stores so that no store gets both a parent and child can be summarized in one sentence stating the number of ways this can be done.

    Copyright:

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

    AMO MTT Session 4 Problem Set

    1) How many bit strings of length n have at least two ones?


    2) Five couples go to the movies together and sit in a row of ten seats. In how many
    ways can the 10 people be arranged if:
    (a) They may sit in any order.
    (b) All the men sit together and all the women sit together.
    (c) Each couple sits together.
    (d) One couple is arguing and they refuse to sit together. The other couples can sit in
    any way.
    3) Rabbits Peter and Pauline have three offspring Flopsie, Mopsie, and Cotton-tail.
    These five rabbits are to be distributed to four different pet stores so that n store gets
    both a parent and a child. It is not required that every store gets a rabbit. In how
    many ways can this be done?
    4) Ateneo de Manila High School is competing against De La Salle Greenhills in a chess
    match. Each school has three players and the contest rules require that each player
    play two games against each of the other schools players. The match takes place in
    six rounds, with three games played simultaneously in each round. In how many
    different ways can the match be scheduled?
    5) A dessert chef prepares the dessert for every day of a week starting with Sunday. The
    dessert each day is either cake, pie, ice cream, or pudding. The same dessert may
    not be served two days in a row. There must be cake on Friday because of a birthday.
    How many different dessert menus for the week are possible?
    6) Consider the 3-dimensional (x,y,z) space of points with integer coordinates. Any point
    can be reached from the origin (0,0,0) by taking steps of 1 unit in the positive or
    negative x, y, or z direction moving from point to point in the grid. A direct path from
    the origin to a point is a path which uses as few steps as possible, e.g. a direct path
    from the origin to (-3,2,-2) takes 7 steps. How many different direct paths are there
    from the origin to the point (-3,2,-2)?
    7) How many ways can 4 men and 4 women be seated in a circular table so that the
    genders alternate?
    8) A local dairy offers 16 flavors of ice cream.
    (a) How many ways are there to choose eight scoops of ice cream?
    (b) How many ways are there to choose eight scoops of ice cream of eight different
    flavors?
    (c) How many ways are there to distribute the eight scoops of part (b) to four
    students so that each student gets two scoops?
    (d) How many ways are there to distribute eight identical scoops of chocolate ice
    cream to four students so that each student gets at least one scoop?
    (e) If a professor wants to purchase a triple-scoop ice cream cone, how many choices
    does she have? Does the order of flavors on the cone matter? Answer the
    question for both cases.
    9) A rumor is spread among m college students as follows. The person who starts the
    rumor telephones someone and then that person telephones someone else, and so
    on. Assume any person can pass along the rumor to anyone except the person from
    whom the rumor was heard. How many different paths through the group can the
    rumor follow in n calls?
    10)
    At a wedding ceremony every brides guest is friends with exactly 5 grooms
    guests, and every grooms guest is friends with exactly 4 brides guests. Which is
    greater: the number of brides guests or the number of grooms guests?

    You might also like