Difference between revisions of "2001 AIME I Problems/Problem 14"
XXQw3rtyXx (talk | contribs) (→Problem) |
Mathcool2009 (talk | contribs) |
||
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? | 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 == | ||
+ | Let <math>0</math> represent a house that does not receive mail and <math>1</math> represent a house that does receive mail. This problem is now asking for the number of <math>19</math>-digit strings of <math>0</math>'s and <math>1</math>'s such that there are no two consecutive <math>1</math>'s and no three consecutive <math>0</math>'s. | ||
+ | |||
+ | The last two digits of any <math>n</math>-digit string can't be <math>11</math>, so the only possibilities are <math>00</math>, <math>01</math>, and <math>10</math>. | ||
+ | |||
+ | Let <math>a_n</math> be the number of <math>n</math>-digit strings ending in <math>00</math>, <math>b_n</math> be the number of <math>n</math>-digit strings ending in <math>01</math>, and <math>c_n</math> be the number of <math>n</math>-digit strings ending in <math>10</math>. | ||
+ | |||
+ | If an <math>n</math>-digit string ends in <math>00</math>, then the previous digit must be a <math>1</math>, and the last two digits of the <math>n-1</math> digits substring will be <math>10</math>. So | ||
+ | <cmath>a_{n} = c_{n-1}.</cmath> | ||
+ | |||
+ | If an <math>n</math>-digit string ends in <math>01</math>, then the previous digit can be either a <math>0</math> or a <math>1</math>, and the last two digits of the <math>n-1</math> digits substring can be either <math>00</math> or <math>10</math>. So | ||
+ | <cmath>b_{n} = a_{n-1} + c_{n-1}.</cmath> | ||
+ | |||
+ | If an <math>n</math>-digit string ends in <math>10</math>, then the previous digit must be a <math>0</math>, and the last two digits of the <math>n-1</math> digits substring will be <math>01</math>. So | ||
+ | <cmath>c_{n} = b_{n-1}.</cmath> | ||
+ | |||
+ | Clearly, <math>a_2=b_2=c_2=1</math>. Using the [[recursion|recursive]] equations and initial values: | ||
+ | <cmath>\begin{tabular}[t]{|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|} | ||
+ | \multicolumn{19}{c}{}\\\hline | ||
+ | n&2&3&4&5&6&7&8&9&10&11&12&13&14&15&16&17&18&19\\\hline | ||
+ | a_n&1&1&1&2&2&3&4&5&7&9&12&16&21&28&37&49&65&86\\\hline | ||
+ | b_n&1&2&2&3&4&5&7&9&12&16&21&28&37&49&65&86&114&151\\\hline | ||
+ | c_n&1&1&2&2&3&4&5&7&9&12&16&21&28&37&49&65&86&114\\\hline | ||
+ | \end{tabular}</cmath> | ||
+ | |||
+ | Therefore, the number of <math>19</math>-digit strings is <math>a_{19}+b_{19}+c_{19} = 86+151+114 = \boxed{351}.</math> | ||
== See also == | == See also == |
Revision as of 18:08, 15 July 2014
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
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:
\[\begin{tabular}[t]{|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|} \multicolumn{19}{c}{}\\\hline n&2&3&4&5&6&7&8&9&10&11&12&13&14&15&16&17&18&19\\\hline a_n&1&1&1&2&2&3&4&5&7&9&12&16&21&28&37&49&65&86\\\hline b_n&1&2&2&3&4&5&7&9&12&16&21&28&37&49&65&86&114&151\\\hline c_n&1&1&2&2&3&4&5&7&9&12&16&21&28&37&49&65&86&114\\\hline \end{tabular}\] (Error compiling LaTeX. ! Missing $ inserted.)
Therefore, the number of -digit strings is
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.