Cas Gentry

Homework #3 (Total score: 21/25)

Rosen, Section 4.3: p. 257-260

(3/3)
20. A professor writes 40 discrete math true/false questions. If the questions can be
positioned in any order, how many different answer keys are possible?
There are 40 questions, 17 of which must be true - C(40,17) = 40! / [17! *
(40-17)!]

(3/3)
28. How many bit strings contain exactly five 0s and fourteen 1s if every 0 must be
immediately followed by two 1s?
That every 0 must be followed by two 1s gives us a set of 011. With five 0s,
we already have ten 1s by default. That leaves four 1s unaccounted for so
we now have five 011s and four 1s.
C(9,4) = 9! / (5! * 4!) = 126

(3/3)
32. How many ways are there to seat six people around a circular table, where
seatings are considered to be the same if they can be obtained from each other by
rotating the table?
P(6,6) = 720 but there are 6 rotations per seating thus 720/6 = 120

Rosen, Section 4.6: p. 294-6

(3/3)
8. How many different ways are there to choose a dozen donuts from the 21
varieties at a donut shop?
r=12, n=21
C(12+21-1,12)= C(32,12) = 32! / [12! * (32-12)!]
(3/3)
14. How many solutions are there to the equation x 1 + x2 + x3 + x4 = 17 where x1,
x2, x3, and x4 are nonnegative integers?
r=4, n=17
C(4+17-1, 17) = C(20,17) = 20! / [17! * (20-17)!]

(4/4)
34. A professor packs her collection of 40 issues of a math journal in four boxes with
10 issues per box. How many ways can she distribute the journals if
a) each box is numbered, so that they are distinguishable?
There are four boxes with 10 journals per box (so r=10 in all boxes).
After we put 10 journals into the first box (n=40), we are left with 30
journals to choose from so n becomes 30, and so on until the fourth
box is filled. The equation:
C(40,10)*C(30,10)*C(20,10)*C(10,10)
= [40!/(10!*(40-10)!)]*[40!/(10!*(40-10)!)]*[40!/ (10!*(40-10)!)]*[40!/
(10!*(40-10)!)]
= 40! / (10!)^4
 Cas Gentry

b) the boxes are identical, so that they cannot be distinguished?

If they cant be distinguished, multiply the denominator of the final
answer for the previous question by the number of boxes factorial.
= 40! / [(10!)^4*4!]

(0/3)
46. How many ways are there to distribute five distinguishable objects into three
indistinguishable boxes?
r=5, n=3
C(5+3-1,5) = C(7,5) = 7! / [5! * (7-5)!]
No, this would be five indistinguishable objects into three distinguishable
boxes.

(2/3)
8. Find the number of integers between 1 and 10,000 which contain both a 6 and a
7.
(assuming that 6 and 7 can be repeated in the number, right? Yes)
10,000 = 10^54
Total numbers not containing a 6 or 7 8^54
Using the Inclusion Principle: 10^54 (9^54 +9^54 8^54)

A sentence or two to spell it out more, would be useful. Also, you should
explain the 9^4, as well.