Browse · MathNet
PrintBulgarian Mathematical Olympiad
Bulgaria counting and probability
Problem
All points in the plane having integer coordinates are colored in three colors. Find the least positive integer having the following property: for arbitrary such covering there exists a triangle of area having all its vertices in one and the same color.
Solution
Consider the following two colorings:
(1) Point is in color , if and only if .
(2) Point is in color , if and only if .
It is clear that if exists then is an integer. Coloring (1) implies that could be , , or greater and coloring (2) shows that could be , or greater. Therefore if exists then .
We prove that for arbitrary coloring there exists a triangle of area having all its vertices in one and the same color. Note that for some there exist points and of the same color. Indeed, it suffices to consider the points . If and is parallel to at distance from then the line is either having points of only two colors or we have a triangle of area .
We say that a color permits distance in the line if there exist two points on having color and at distance apart.
If there exists a distance that is permitted by the two colors on then the line at a distance from is having all its points in the same color. If such a distance does not exist then one of the colors permits all distances in the set .
(Indeed, assume that color does not permit distance , and there exists at least one point from having color . Two neighbors of - points and are colored in , so permits distance . Therefore does not permit distance and points and are of color . As above does not permit distance . does not permit distance and and are of color . Thus permits all distances in .)
In both cases there exists a line and color from that permits all distances in the set .
Consider the lines , parallel to and such that , is at distance above . It follows from the above that all such lines are having points only in two colors. Finally, consider all nine points of intersection of lines with lines , , . It is easy to see that there exists a triangle of area having all its vertices colored in the same color.
(1) Point is in color , if and only if .
(2) Point is in color , if and only if .
It is clear that if exists then is an integer. Coloring (1) implies that could be , , or greater and coloring (2) shows that could be , or greater. Therefore if exists then .
We prove that for arbitrary coloring there exists a triangle of area having all its vertices in one and the same color. Note that for some there exist points and of the same color. Indeed, it suffices to consider the points . If and is parallel to at distance from then the line is either having points of only two colors or we have a triangle of area .
We say that a color permits distance in the line if there exist two points on having color and at distance apart.
If there exists a distance that is permitted by the two colors on then the line at a distance from is having all its points in the same color. If such a distance does not exist then one of the colors permits all distances in the set .
(Indeed, assume that color does not permit distance , and there exists at least one point from having color . Two neighbors of - points and are colored in , so permits distance . Therefore does not permit distance and points and are of color . As above does not permit distance . does not permit distance and and are of color . Thus permits all distances in .)
In both cases there exists a line and color from that permits all distances in the set .
Consider the lines , parallel to and such that , is at distance above . It follows from the above that all such lines are having points only in two colors. Finally, consider all nine points of intersection of lines with lines , , . It is easy to see that there exists a triangle of area having all its vertices colored in the same color.
Final answer
3
Techniques
Coloring schemes, extremal argumentsPigeonhole principleConstructions and loci