- 3

- 0

(a) In an office, at various times during the day, the boss gives the secretary a letter to type, each time putting the letter on top of the pile in the secretary's inbox. When there is time, the secretary takes the top letter off the pile and types it. There are nine letters to be typed during the day, and the boss delivers them in the order 1, 2, 3, 4, 5, 6, 7, 8, 9. While leaving for lunch, the secretary tells a colleague that letter 8 has already been typed, but says nothing else about the morning's typing. The colleague wonders which of the nine letters remain to be typed after lunch and in what order they will be typed. Based upon the above information, how many such

*after lunch typing orders*are possible? (That there are no letters left to be typed is one of the possibilities.)

(b) Suppose there are

*n*letters in the problem above and letter (

*n*- 1) has been typed. Write a general expression for the number of

*after lunch typing orders*possible.

Like I said, we've been doing this one for a couple days. If the 9th letter is delivered before lunch, there are 256 possibilities. But that doesn't take into account it being delivered after lunch, which is the part we cannot figure out. We think you have to find some type of formula that involves combinations, but we're not 100%. Help please?