Difference between revisions of "1977 AHSME Problems/Problem 20"
(→Solution) |
(→Solution 1) |
||
| (9 intermediate revisions by the same user not shown) | |||
| Line 8: | Line 8: | ||
==Solution== | ==Solution== | ||
| − | > | + | |
| + | The path will either start on the left side, start on the right side, or go down the middle. Say it starts on the left side. Instead of counting it starting from the <math>C</math>, let's start at the T and work backwards. Starting at the <math>T</math>, there are <math>2</math> options to choose the <math>S</math>. Then, there are <math>2</math> options to chose the <math>E</math>, <math>T</math>, <math>N</math>, <math>O</math>, and <math>C</math>, for a total of <math>2^6=64</math> possibilities. But we need to subtract the case where it does down the middle, which makes it <math>63</math> possibilities. The right side also has <math>63</math> possibilities by symmetry. There is <math>1</math> way for it to go down the middle, for a total of <math>63+63+1=127</math> paths, so the answer is <math>\textbf{(E) }\text{none of these}</math>. | ||
| + | |||
| + | ~alexanderruan | ||
Latest revision as of 23:25, 1 January 2024
Problem
For how many paths consisting of a sequence of horizontal and/or vertical line segments, with each segment connecting a pair of adjacent letters in the diagram above, is the word CONTEST spelled out as the path is traversed from beginning to end?
Solution
The path will either start on the left side, start on the right side, or go down the middle. Say it starts on the left side. Instead of counting it starting from the 
, let's start at the T and work backwards. Starting at the 
, there are 
options to choose the 
. Then, there are options to chose the 
, , 
, 
, and , for a total of 
possibilities. But we need to subtract the case where it does down the middle, which makes it 
possibilities. The right side also has possibilities by symmetry. There is 
way for it to go down the middle, for a total of 
paths, so the answer is 
.
~alexanderruan
