Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "1987 AHSME Problems/Problem 12"

(→‎Problem)
(Added a solution with explanation)
Line 8: Line 8:
 
\textbf{(D)}\ 4\ 5\ 2\ 3\ 1 \qquad
 
\textbf{(D)}\ 4\ 5\ 2\ 3\ 1 \qquad
 
\textbf{(E)}\ 5\ 4\ 3\ 2\ 1 \qquad</math>
 
\textbf{(E)}\ 5\ 4\ 3\ 2\ 1 \qquad</math>
 +
 +
== Solution ==
 +
We can show that <math>A</math>, <math>B</math>, <math>C</math>, and <math>E</math> are possible.
 +
<math>A</math>: the boss delivers <math>1</math>, then the secretary does <math>1</math>, then the boss delivers <math>2</math>, then the secretary does <math>2</math>, etc. up to <math>5</math>.
 +
<math>B</math>: the boss delivers <math>1</math>, then delivers <math>2</math>, then the secretary does <math>2</math>, then the boss delivers <math>3</math>, then delivers <math>4</math>, then the secretary does <math>4</math>, then the secretary does <math>3</math>, then the boss delivers <math>5</math>, then the secretary does <math>5</math>, then the secretary does <math>1</math>.
 +
<math>C</math>: the boss delivers <math>1</math>, then delivers <math>2</math>, then delivers <math>3</math>, then the secretary does <math>3</math>, then does <math>2</math>, then the boss delivers <math>4</math>, then the secretary does <math>4</math>, then does <math>1</math>, then the boss delivers <math>5</math>, then the secretary does <math>5</math>.
 +
<math>E</math>: the boss delivers <math>1</math>, then <math>2</math>, then <math>3</math>, then <math>4</math>, then <math>5</math>, then the secretary does <math>5</math>, does <math>4</math>, etc. down to <math>1</math>.
 +
 +
Hence the answer must be <math>\boxed{\text{D}}</math>. To give a complete proof, we need to show <math>D</math> is impossible. In order for the secretary to start with <math>4</math>, the boss must deliver <math>1</math>, <math>2</math>, <math>3</math>, and <math>4</math>, then the secretary does <math>4</math>. To get <math>5</math> next, the boss next delivers <math>5</math>, then the secretary does <math>5</math>, but now we can't get <math>2</math>, <math>3</math>, <math>1</math>: the remaining letters must start with <math>3</math>, which is on the top of the pile. Hence <math>D</math> is impossible, as required.
  
 
== See also ==
 
== See also ==

Revision as of 13:20, 1 March 2018

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. If there are five letters in all, and the boss delivers them in the order $1\ 2\ 3\ 4\ 5$, which of the following could not be the order in which the secretary types them?

$\textbf{(A)}\ 1\ 2\ 3\ 4\ 5 \qquad \textbf{(B)}\ 2\ 4\ 3\ 5\ 1 \qquad \textbf{(C)}\ 3\ 2\ 4\ 1\ 5 \qquad \textbf{(D)}\ 4\ 5\ 2\ 3\ 1 \qquad \textbf{(E)}\ 5\ 4\ 3\ 2\ 1 \qquad$

Solution

We can show that $A$, $B$, $C$, and $E$ are possible. $A$: the boss delivers $1$, then the secretary does $1$, then the boss delivers $2$, then the secretary does $2$, etc. up to $5$. $B$: the boss delivers $1$, then delivers $2$, then the secretary does $2$, then the boss delivers $3$, then delivers $4$, then the secretary does $4$, then the secretary does $3$, then the boss delivers $5$, then the secretary does $5$, then the secretary does $1$. $C$: the boss delivers $1$, then delivers $2$, then delivers $3$, then the secretary does $3$, then does $2$, then the boss delivers $4$, then the secretary does $4$, then does $1$, then the boss delivers $5$, then the secretary does $5$. $E$: the boss delivers $1$, then $2$, then $3$, then $4$, then $5$, then the secretary does $5$, does $4$, etc. down to $1$.

Hence the answer must be $\boxed{\text{D}}$. To give a complete proof, we need to show $D$ is impossible. In order for the secretary to start with $4$, the boss must deliver $1$, $2$, $3$, and $4$, then the secretary does $4$. To get $5$ next, the boss next delivers $5$, then the secretary does $5$, but now we can't get $2$, $3$, $1$: the remaining letters must start with $3$, which is on the top of the pile. Hence $D$ is impossible, as required.

See also

1987 AHSME (Problems • Answer Key • Resources)
Preceded by
Problem 11 		Followed by
Problem 13
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30
All AHSME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1987_AHSME_Problems/Problem_12&oldid=92547"