Browse · MathNet
PrintVietnam Mathematical Olympiad
Vietnam counting and probability
Problem
In plane, let be given an octagon such that no three of its diagonals are concurrent. Each point of intersection of every two diagonals of the octagon is called a cross. Consider the convex quadrilaterals whose vertices are vertices of the given octagon. Each such quadrilateral is called a subquadrilateral. Find the least positive integer such that one can colour crosses so that for every and , if we denote by the number of
subquadrilaterals admitting as vertices and admitting a coloured cross as the point of intersection of the diagonals then the values are all equal.
subquadrilaterals admitting as vertices and admitting a coloured cross as the point of intersection of the diagonals then the values are all equal.
Solution
Suppose that there are crosses which can be coloured so that the numbers are all equal. Denote by the common value of these numbers. Since for each couple of vertices of the octagon, there exist exactly subquadrilaterals admitting as vertices and admitting a coloured cross as the point of intersection of diagonals, hence the number of coloured crosses (with iterations) is . Since for each coloured cross, there exist exactly couples of vertices of the octagon which define a same subquadrilateral admitting this coloured cross as the point of intersection of the diagonals, each coloured cross is counted times in the above mentioned numeration. Therefore, As is a positive integer, is divisible by . So and it implies . Now we describe a colouring of crosses so that numbers are all equal. For this purpose, we shall denote a cross by a subquadrilateral admitting it as the point of intersection of its diagonals and we shall denote the subquadrilateral by . We colour the following crosses: (1234), (1256), (1278), (1357), (1368), (1458), (1467); (2358), (2367), (2457), (2468), (3456), (3478), (5678). By direct verification for each couple of vertices of the octagon, we see that for all . So the required least positive integer is .
Final answer
14
Techniques
Counting two waysColoring schemes, extremal argumentsCombinatorial Geometry