Difference between revisions of "1988 AIME Problems/Problem 15"

m (Problem)
(solution)
Line 1: Line 1:
 
== Problem ==
 
== Problem ==
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 in-box. 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.
+
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 in-box. 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 <math>1, 2, 3, 4, 5, 6, 7, 8, 9</math>.
  
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.)
+
While leaving for lunch, the secretary tells a colleague that letter <math>8</math> 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.)
  
 
== Solution ==
 
== Solution ==
{{solution}}
+
Re-stating the problem for clarity, let <math>S</math> be a [[set]] arranged in increasing order. At any time an element can be appended to the end of <math>S</math>, or the last element of <math>S</math> can be removed. The question asks for the number of different orders in which the all of the remaining elements of <math>S</math> can be removed, given that <math>8</math> had been removed already. 
 +
----
 +
 
 +
Since <math>8</math> had already been added to the pile, the numbers <math>1 \ldots 7</math> had already been added at some time to the pile; <math>9</math> might or might not have been added yet. So currently <math>S</math> is a subset of <math>\{1, 2, \ldots 7\}</math>, possibly with <math>9</math> at the end. Given that <math>S</math> has <math>k</math> elements, there are <math>k+1</math> intervals for <math>9</math> to be inserted, or <math>9</math> might have already been placed, giving <math>k+2</math> different possibilities.
 +
 
 +
Thus, the answer is <math>\sum_{k=0}^{7} {7 \choose k}(k+2)</math> <math>= 1 \cdot 2 + 7 \cdot 3 + 21 \cdot 4 + 35 \cdot 5 + 35 \cdot 6 + 21 \cdot 7 + 7 \cdot 8 + 1 \cdot 9</math> <math>= \boxed{704}</math>.
  
 
== See also ==
 
== See also ==
 
{{AIME box|year=1988|num-b=14|after=Last Question}}
 
{{AIME box|year=1988|num-b=14|after=Last Question}}
 +
 +
[[Category:Intermediate Combinatorics Problems]]

Revision as of 14:39, 2 December 2007

Problem

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 in-box. 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.)

Solution

Re-stating the problem for clarity, let $S$ be a set arranged in increasing order. At any time an element can be appended to the end of $S$, or the last element of $S$ can be removed. The question asks for the number of different orders in which the all of the remaining elements of $S$ can be removed, given that $8$ had been removed already.


Since $8$ had already been added to the pile, the numbers $1 \ldots 7$ had already been added at some time to the pile; $9$ might or might not have been added yet. So currently $S$ is a subset of $\{1, 2, \ldots 7\}$, possibly with $9$ at the end. Given that $S$ has $k$ elements, there are $k+1$ intervals for $9$ to be inserted, or $9$ might have already been placed, giving $k+2$ different possibilities.

Thus, the answer is $\sum_{k=0}^{7} {7 \choose k}(k+2)$ $= 1 \cdot 2 + 7 \cdot 3 + 21 \cdot 4 + 35 \cdot 5 + 35 \cdot 6 + 21 \cdot 7 + 7 \cdot 8 + 1 \cdot 9$ $= \boxed{704}$.

See also

1988 AIME (ProblemsAnswer KeyResources)
Preceded by
Problem 14
Followed by
Last Question
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
All AIME Problems and Solutions