MC 36 -- Spring 1999
Problem Set 2
Due 2/26/99
-
Grimaldi 1.4: 2, 16, 18
-
Grimaldi 2.1: 4, 6, 8be, 12
-
Grimaldi 2.2: 6bd, 14 (not by Truth Table), 20
-
Grimaldi 2.3: 4, 8, 10acf, 12ac
MC 36 -- Spring 1999
Problem Set 1
Due 2/17/99
-
Grimaldi 1.1/1.2: 4,10,22,34
-
Grimaldi 1.3: 4,8,20
-
In how many ways can ten adults and five children stand in a circle so
that no two children are next to each other?
-
Give a combinatorial proof that
C(m+n,r) = C(m,0)C(n,r) + C(m,1)C(n,r-1) + ... +C(m,r)C(n,0)
where m and n are positive integers and r is an integer that is less
than or equal to both m and n.
(Hint: Think of a group of m+n people composed of two groups,
one with m members and the other with n, say m MSWindow users and n Linux
users.)