MCS  256:  Discrete Calculus and Probability
Spring 2004

Homework problems   Reading assignments, part 2
MCS-256 homepage
Homework guidelines
Prof. Barbara Kaiser


Current Homework Assignment
 Due April 23
Practice problems:

    None this time
Hand in:
  • Chapter 5, #18, 35a, 41
  • Given five (distinct) pairs of gloves, how many ways are there for five people to each choose two gloves with no one getting a matching pair?
  • How many ways are there to arrange the integers from 1 to n in such a way that no  two consecutive integers are next to each other, with the smaller one first and the larger one second.  (In other words, for each i, 1<= i < n, i is not followed by i+1.)  Show your answer is Dn +Dn-1.



Last modified: 4/25/4