Difference between revisions of "1977 AHSME Problems/Problem 20"
(Created page with "==Problem== <math>\begin{tabular}{ccccccccccccc}& & & & & & C & & & & & &\\ & & & & & C & O & C & & & & &\\ & & & & C & O & N & O & C & & & &\\ & & & C & O & N & T & N & O...") |
(→Solution) |
||
| Line 8: | Line 8: | ||
==Solution== | ==Solution== | ||
| + | nothing | ||
Revision as of 20:22, 18 August 2023
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
nothing
