Difference between revisions of "1973 Canadian MO Problems/Problem 4"
m (Created page with "==Problem== ==Solution== ==See also== *1973 Canadian MO {{CanadaMO box|year=1973||num-b=3||num-a=5}}") |
(→Problem) |
||
Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
− | + | The figure shows a (convex) polygon with nine vertices. The six diagonals which have been drawn dissect the polygon into the seven triangles: <math>P_{0}P_{1}P_{3}, P_{0}P_{3}P_{6}, P_{0}P_{6}P_{7}, P_{0}P_{7}P_{8}, P_{1}P_{2}P_{3}, P_{3}P_{4}P_{6}, P_{4}P_{5}P_{6}</math>. In how many ways can these triangles be labeled with the names <math>\triangle_{1}, \triangle_{2}, \triangle_{3}, \triangle_{4}, \triangle_{5}, \triangle_{6}, \triangle_{7}</math> so that <math>P_{i}</math> is a vertex of triangle <math>\triangle_{i}</math> for <math>i = 1, 2, 3, 4, 5, 6, 7</math>? Justify your answer. | |
==Solution== | ==Solution== |
Revision as of 16:50, 8 October 2014
Problem
The figure shows a (convex) polygon with nine vertices. The six diagonals which have been drawn dissect the polygon into the seven triangles: . In how many ways can these triangles be labeled with the names so that is a vertex of triangle for ? Justify your answer.
Solution
See also
1973 Canadian MO (Problems) | ||
Preceded by Problem 3 |
1 • 2 • 3 • 4 • 5 | Followed by Problem 5 |