Difference between revisions of "2001 AIME I Problems/Problem 14"
(→Solution 2 ( Less recursion than solution 1)) |
(→Solution 3 (Tedious Casework)) |
||
Line 39: | Line 39: | ||
==Solution 3 (Tedious Casework) == | ==Solution 3 (Tedious Casework) == | ||
− | We split the problem into cases using the number of houses that get mail. Let "|" represent a house that gets mail, and "o" represent a house that doesn't. With a fixed number of |, an o can be inserted between 2 |'s or on the very left or right. There cannot be more than one o that is free to arrange to be placed between two |'s because no three o's can be adjacent, but there can be a maximum of two o's placed on the very left or right. Note that according to the Pigeonhole Principle, no more than 10 houses can get mail on the same day. | + | We split the problem into cases using the number of houses that get mail. Let "|" represent a house that gets mail, and "o" represent a house that doesn't. With a fixed number of |, an o can be inserted between 2 |'s or on the very left or right. There cannot be more than one o that is free to arrange to be placed between two |'s because no three o's can be adjacent, but there can be a maximum of two o's placed on the very left or right. Note that according to the [[Pigeonhole Principle|Pigeonhole Principle]], no more than 10 houses can get mail on the same day. |
Case 1: 10 houses get mail. No 2 adjacent houses can get mail on the same day, so there must be an o between every two |. <math>10-1=9</math> o's are fixed so we count the number of ways to insert <math>19 - 10 - 9 = 0</math> o's to <math>10+1 = 11</math> spots, or <math>\binom{11}{0} = 1</math>. | Case 1: 10 houses get mail. No 2 adjacent houses can get mail on the same day, so there must be an o between every two |. <math>10-1=9</math> o's are fixed so we count the number of ways to insert <math>19 - 10 - 9 = 0</math> o's to <math>10+1 = 11</math> spots, or <math>\binom{11}{0} = 1</math>. |
Revision as of 21:40, 21 November 2018
Contents
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?
Solutions
Solution 1
Let represent a house that does not receive mail and
represent a house that does receive mail. This problem is now asking for the number of
-digit strings of
's and
's such that there are no two consecutive
's and no three consecutive
's.
The last two digits of any -digit string can't be
, so the only possibilities are
,
, and
.
Let be the number of
-digit strings ending in
,
be the number of
-digit strings ending in
, and
be the number of
-digit strings ending in
.
If an -digit string ends in
, then the previous digit must be a
, and the last two digits of the
digits substring will be
. So
If an -digit string ends in
, then the previous digit can be either a
or a
, and the last two digits of the
digits substring can be either
or
. So
If an -digit string ends in
, then the previous digit must be a
, and the last two digits of the
digits substring will be
. So
Clearly, . Using the recursive equations and initial values:
As a result .
Solution 2 ( Less recursion than solution 1)
Let represent the number of mail delivery patterns that end with the last house receiving mail. This is
in Solution 1. Similarly define
to be the number of mail delivery patterns that end with last house not receiving mail. This is just
and
in solution 1. Let
be the total number of mail delivery patterns.
Here are the possible ending cases: the string ends in or
. The first case is just
. The second case is
. The third case is
. So we have
. Since we want
, it is just
.
Now using the same logic as above we can find
( the cases are 01 and 001). We can refer back to solution 1's table and only keep track of
, ignoring both
and
.
- MathLegend27
Solution 3 (Tedious Casework)
We split the problem into cases using the number of houses that get mail. Let "|" represent a house that gets mail, and "o" represent a house that doesn't. With a fixed number of |, an o can be inserted between 2 |'s or on the very left or right. There cannot be more than one o that is free to arrange to be placed between two |'s because no three o's can be adjacent, but there can be a maximum of two o's placed on the very left or right. Note that according to the Pigeonhole Principle, no more than 10 houses can get mail on the same day.
Case 1: 10 houses get mail. No 2 adjacent houses can get mail on the same day, so there must be an o between every two |. o's are fixed so we count the number of ways to insert
o's to
spots, or
.
Case 2: 9 houses get mail. In this case, o's are fixed so we count the number of ways to insert
o's to
spots. However, there is also the case where two o's are both on the very left / right. When both o's that are free to arrange are put on a side, there are
spots left to insert
o's. Hence the total number of ways in this case is
.
Case 3: 8 houses get mail. In this case, o's are fixed so we count the number of ways to insert
o's to
spots. When two o's are put to the very left / right, there are
spots left to insert
o's. We also need to take care of the case where two o's are on the very left and two o's are on the very right: we have
spots to insert
o's. Hence the total number of ways in this case is
.
Case 4: 7 houses get mail. In this case, o's are fixed so we count the number of ways to insert
o's to
spots. When two o's are put to the very left / right, there are
spots left to insert
o's. When two o's are on the very left and two o's are on the very right, we have
spots to insert
o's. Hence the total number of ways in this case is
.
Case 5: 6 houses get mail. We have to be careful in this case: o's are fixed so we are inserting
o's to
spots, which means that at least 1 of the 2 sides must have two o's. When 1 of the 2 sides have two o's, there are
spots to insert
o's. When both sides have two o's, there are
spots to insert
o's. Hence the total number of ways in this case is
.
When less than 6 houses get(s) mail, it's again not possible since at least three o's must be together (again, according to the Pigeonhole Principle). Therefore, the desired answer is .
- MP8148
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.