Scribd
Upload
139 views3 pages

Problem Set 1 Solutions

This document contains solutions to 10 problems involving combinatorics and probability. The problems cover topics like arranging people, solving equations with restrictions, selecting committees, permutations of letters, and coin combinations. Formulas and calculations are provided for each multi-part problem.

Uploaded by

Earl Francis Valdehuesa
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
139 views3 pages

Problem Set 1 Solutions

This document contains solutions to 10 problems involving combinatorics and probability. The problems cover topics like arranging people, solving equations with restrictions, selecting committees, permutations of letters, and coin combinations. Formulas and calculations are provided for each multi-part problem.

Uploaded by

Earl Francis Valdehuesa
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/ 3

CMSC 57: Discrete Mathematical Structures in Computer Science 2 (Section 1)

Problem Set 1
1. In how many ways can a photographer at a wedding arrange six people in a row,
including the bride and groom, if
a. the bride must be next to the groom?
Solution:
P(5,5) * P(2,2) = 240 ways
b. the bride is not next to the groom?
Solution:
P(6,6) 240 = 480 ways
c. the bride is positioned somewhere to the left of the groom?
C(6,2) * P(4,4) = 360 ways
2. How many solutions are there to the equation x1 + x2 + x3 + x4 + x5 + x6 = 29,
where xi = 1, 2, 3, 4, 5, 6, is a nonnegative integer such that
a. xi > 1 for i = 1, 2, 3, 4, 5, 6?
Solution:
(y1+2) + (y2+2) + (y3+2) + (y4+2) + (y5+2) + (y6+2) = 29
y1 + y2 + y3 + y4 + y5 + y6 = 29 12 = 17
C(17 + 6 1, 17) = 26,334 solutions
b. x1 > 1, x2 > 2, x3 > 3, x4 > 4, x5 > 5, and x6 > 6?
Solution:
(y1+1) + (y2+2) + (y3+3) + (y4+4) + (y5+6) + (y6+6) = 29
y1 + y2 + y3 + y4 + y5 + y6 = 29 22 = 7
C(7 + 6 1, 7) = 792 solutions
c. x1 < 5?
Solution:
x1 + x2 + x3 + x4 + x5 + x6 = 29
C(29 + 6 1, 29) = 278,256 solutions
(y1 + 6) + y2 + y3 + y4 + y5 + y6 = 29
y1 + y2 + y3 + y4 + y5 + y6 = 29 6 = 23
C(23 + 6 1, 23) = 98,280 solutions
278,256 98,280 = 179,976 solutions
d. x1 < 8 and x2 > 8?
x2 > 9 C(20 + 6 1, 20) = 53,130
x1 > 8, x2 > 9 C(12 + 6 1) = 6,188
53,130 6,188 = 46,942 solutions
3. There are 12 signs of the zodiac. How many people are needed to guarantee that at
least six of these people have the same sign?
Solution:

=6
12
= (12 5) + 1
= 61
4. How many ways are there to choose a dozen donuts from 20 varieties
a. if there are no two donuts of the same variety?
Solution:
C(20,12) = 125,970 ways
b. if all donuts are of the same variety?
Solution:
C(20,1) = 20 ways

CMSC 57: Discrete Mathematical Structures in Computer Science 2 (Section 1)


Problem Set 1
c. if there are no restrictions?
Solution:
C(20 + 12 1, 12) = 141,120,525 ways
d. if there are at least two varieties?
Solution:
141,120,525 20 = 141,120,505 ways
e. if there must be at least six blueberry-filled donuts?
Solution:
r = 12 6 = 6
C(20 + 6 1, 6) = 177,100 ways
f.

if there can be no more than six blueberry-filled donuts?


Solution:
12
=6 C 19 + r 1, r = 141,078,021 ways

5. What is the coefficient of x7 in (1 + x)11?


Solution:
11
1

11
11 11

(1 + ) =

11, 1
=0

11, 11

=
=0

x7 is C(11,7) = 330

6. Seven women and nine men are on the faculty in the Computer Science cluster at a
school.
a. How many ways are there to select a committee of five members of the cluster
if at least one woman must be on the committee?
Solution:
C(16,5) - C(9,5) = 4,242 ways
b. How many ways are there to select a committee of five members of the
department if at least one woman and at least one man must be on the
committee?
Solution:
4,242 C(7,5) = 4,221 ways
7. Pia Wurtzbach has three mangoes, two papayas, and two kiwi fruits. If she eats one
piece of fruit each day, and only the type of fruit matters, in how many different
ways can these fruits be consumed?
Solution:
7!
= 210
3! 2! 2!
8. How many different strings can be made from the letters, using all the letters, in
a. MISSISSIPPI?
Solution:
1 M, 4 Is, 4 Ss, 2 Ps
C(11,1)C(10,4)C(6,4)C(2,2) = 34,650 strings
b. ABRACADABRA?
Solution:
5 As, 2 Bs, 2 Rs, 1 C, 1 D
C(11,5)C(6,2)C(4,2)C(2,1)C(1,1) = 83,160 strings
c. AARDVARK?
Solution:
3 As, 2 Rs, 1 D, 1 V, 1 K
C(8,3)C(5,2)C(3,1)C(2,1)C(1,1) = 3,360 strings

CMSC 57: Discrete Mathematical Structures in Computer Science 2 (Section 1)


Problem Set 1
9. There are 10 questions on a discrete mathematics exam. How many ways are there
to assign scores to the problems if the sum of the scores is 100 and each question is
worth at least 5 points?
Solution:
n = 10
r = 50
C(10 + 50 1, 50) = 12,565,671,261 ways
10. How many different combinations of 5-cent, 25-cent, 1-peso, 5-peso, and 10-peso
coins can a piggy bank contain if it has 20 coins in it?
Solution:
n=5
r = 20
C(5 + 20 1, 20) = 10,626 combinations

You might also like