Scribd Logo
Upload

Welcome to Scribd!

  • 18 views

    Combinatorics: The Fine Art of Counting: Week Two Menu

    Uploaded by

    Harikrishna Shenoy
    This document provides a menu of 10 combinatorics problems of varying difficulty. The problems cover topics like counting arrangements, combinations, sequences and patterns. Some problems are identified as contest problems.

    Copyright:

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

    Combinatorics: The Fine Art of Counting: Week Two Menu

    Uploaded by

    Harikrishna Shenoy
    18 views2 pages
    This document provides a menu of 10 combinatorics problems of varying difficulty. The problems cover topics like counting arrangements, combinations, sequences and patterns. Some problems are identified as contest problems.

    Original Description:

    npttl

    Original Title

    MITHFH Homework 2

    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 a menu of 10 combinatorics problems of varying difficulty. The problems cover topics like counting arrangements, combinations, sequences and patterns. Some problems are identified as contest problems.

    Copyright:

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

    Combinatorics: The Fine Art of Counting: Week Two Menu

    Uploaded by

    Harikrishna Shenoy
    This document provides a menu of 10 combinatorics problems of varying difficulty. The problems cover topics like counting arrangements, combinations, sequences and patterns. Some problems are identified as contest problems.

    Copyright:

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

    Combinatorics: The Fine Art of Counting

    Week Two Menu


    This weeks menu consists of many small tasty dishes, some light, some hearty. The Spanish
    refer to this type of meal as Tapas. Please select several. All of these problems have a straightforward solution, but some might be considered difficult to the uninitiated. Contest problems are
    identified. I have made the contest problems easier/harder by leaving out the answer choices
    offered on the test.

    Tapas Menu
    1. How many different ways can you rearrange the letters in BOSTON? How about
    MASSACHUSETTS?
    2. 20 students show up to HSSP looking for open classes. Only 3 classes are still
    open, one has 3 spots, one has 11 spots, and one has 6 spots. How many
    different ways can the students be arranged in the 3 classes?
    3. How many license plates with 3 decimal digits followed by 3 letters do not contain
    both the number 0 and the letter O?
    4. How many ways can you paint the faces of a regular tetrahedron with four colors
    if each face is painted a different color? (Assume that two paintings that can be
    oriented to look the same are considered indistinguishable)
    5. A circular table has 60 chairs around it. There are N people seated at this table
    so that the next person seated must sit next to someone. Find the smallest
    possible value of N. (AHSME 1991 #15)
    6. How many different sequences of the numbers {0,1,2} of length 10 do not contain
    any of the subsequences 12, 23, or 31? 3222132111 is such a sequence.
    (AIME 2003B #3)
    7. A decimal number is called increasing if each digit is greater than the previous
    one (e.g. 24589 is one). How many 5 digit increasing numbers are there?
    (AIME 1992 #2)
    8. Let S = {1, 2, , 10 }. Find the number of unordered pairs A, B where A and B
    are disjoint non-empty subsets of S. (counting unordered pairs simply means
    we dont distinguish the pair A,B and B,A) (AIME 2002B #9)
    9. A 7 digit phone number d1d2d3d4d5d6d7 is called memorable if d1d2d3 is exactly the
    same sequence as d4d5d6 or d5d6d7 (possibly both). (e.g. 4357435 is
    memorable). Assuming each di can be any decimal digit (so d1 could be 0), how
    many memorable telephone numbers are there? (AHMSE 1998 #24)
    10. How many triangles can be formed with vertices on a 4x4 grid of points?
    (AHSME 1993 #28)

    MIT OpenCourseWare
    http://ocw.mit.edu

    Combinatorics: The Fine Art of Counting


    Summer 2007

    For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

    You might also like