2001 AIME I Problems/Problem 14: Difference between revisions
I_like_pie (talk | contribs) No edit summary |
mNo edit summary |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
A mail carrier delivers mail to the nineteen houses on the east side of Elm Street. The carrier notices that no two adjacent houses ever get mail on the same day, but that there are never more than two houses in a row that get no mail on the same day. How many different patterns of mail delivery are possible? | |||
== Solution == | == Solution == | ||
{{solution}} | |||
== See also == | == See also == | ||
{{AIME box|year=2001|n=I|num-b=13|num-a=15}} | |||
Revision as of 23:26, 19 November 2007
Problem
A mail carrier delivers mail to the nineteen houses on the east side of Elm Street. The carrier notices that no two adjacent houses ever get mail on the same day, but that there are never more than two houses in a row that get no mail on the same day. How many different patterns of mail delivery are possible?
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
| 2001 AIME I (Problems • Answer Key • Resources) | ||
| Preceded by Problem 13 |
Followed by Problem 15 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
