Scribd
Upload
4 views1 page

11 C

The document presents a series of combinatorial problems, each requiring distinct mathematical reasoning and calculations. Topics include sums of digits, domino arrangements, probabilities of distances, bishop placements on a chessboard, permutations, weight combinations, audience dynamics, and highway systems among cities. Each problem is designed to challenge understanding of combinatorial principles and their applications.

Uploaded by

allanzhaohm
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views1 page

11 C

The document presents a series of combinatorial problems, each requiring distinct mathematical reasoning and calculations. Topics include sums of digits, domino arrangements, probabilities of distances, bishop placements on a chessboard, permutations, weight combinations, audience dynamics, and highway systems among cities. Each problem is designed to challenge understanding of combinatorial principles and their applications.

Uploaded by

allanzhaohm
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Combinatorics A

1. [3] Consider the sum ab + cde, where each of the letters is a distinct digit between 1 and 5.
How many values are possible for this sum?
2. [3] A set of n dominoes, each colored with one white square and one black square, is used to
cover a 2 × n board of squares. For n = 6, how many different patterns of colors can the board
have? (For n = 2, this number is 6.)
3. [4] Two points are chosen uniformly at random on the sides of a square with side length 1. If
p is the probability that the distance between them is greater than 1, what is b100pc? (Note:
bxc denotes the greatest integer less than or equal to x.)
4. [4] Let N be the number of ways to place 4 bishops on a 5 × 5 chessboard such that no 3 are
on the same diagonal. Find the remainder when N is divided by 100. (Note: the length of a
diagonal on a 5 × 5 chessboard can be 2, 3, 4, or 5.)
5. [5] Let σ be a random permutation of {0, 1, . . . , 6}. Let L(σ) be the length of the longest
initial monotonic consecutive subsequence of σ not containing 0; for example,

L(2, 3, 4, 6, 5, 1, 0) = 3, L(3, 2, 4, 5, 6, 1, 0) = 2, L(0, 1, 2, 3, 4, 5, 6) = 0.


m
If the expected value of L(σ) can be written as n, where m and n are relatively prime positive
integers, then find m + n.
6. [6] For every integer n from 0 to 6, we have 3 identical weights with weight 2n . How many
ways are there to form a total weight of 263 grams using only these given weights?

7. [7] At the start of the PUMaC opening ceremony in McCosh auditorium, the speaker counts
90 people in the audience. Every minute afterwards, either one person enters the auditorium
(due to waking up late) or leaves (in order to take a dreadful math contest). The speaker
observes that in this time, exactly 100 people enter the auditorium, 100 leave, and 100 was
the largest audience size he saw. Find the largest integer m such that 2m divides the number
of different possible sequences of entries and exits given the above information.
8. [8] A road company is trying to build a system of highways in a country with 21 cities. Each
highway runs between two cities. A trip is a sequence of distinct cities C1 , . . . , Cn , for which
there is a highway between Ci and Ci+1 . The company wants to fulfill the following two
constraints:
(1) for any ordered pair of distinct cities (Ci , Cj ), there is exactly one trip starting at Ci and
ending at Cj .
(2) if N is the number of trips including exactly 5 cities, then N is maximized.
What is this maximum value of N ?

You might also like