Maths Olympiad Prep

Track / Stage 6 / 391 of 400 #1391 of 1964

Problem 1391

National Olympiad, first round
Combinatorics Difficulty 6.7 Prove it Olimpiada Matemática Española (Concurso Final) · Mexico

To each point of the set A={(x,y,z)Z3}A = \{(x, y, z) \in \mathbb{Z}^3\}, formed by the points of three-dimensional space whose coordinates are integers, we assign a color from among pp possible colors. Prove that there necessarily exists some right parallelepiped (a polyhedron with six faces in which each face is a rectangle) whose vertices belong to AA and are all of the same color.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

We set n=p(p+12)n = p \binom{p+1}{2}. For each j{0,1,,n}j \in \{0, 1, \dots, n\}, we consider the set Aj0={(i,j,0)A;0ip}A_j^0 = \{(i, j, 0) \in A; 0 \le i \le p\}. By the Pigeonhole Principle, we can guarantee that, for each jj, there are two points of Aj0A_j^0 of the same color. There may be more than two, or it may happen for more than one color; it does not matter, among the p+1p+1 we mark two that share a color. Taking into account that there are p(p+12)+1p \binom{p+1}{2} + 1 possible values of jj, again by the Pigeonhole Principle, there will exist at least r=(p+12)+1r = \binom{p+1}{2} + 1 of these Aj0A_j^0 (say Aj10,,Ajr0A_{j_1}^0, \dots, A_{j_r}^0) in which the color repeated in all of them is the same (color cc). Since the number of ways to choose the two positions (values of ii) in each of these Ajt0A_{j_t}^0, with t=1,,rt = 1, \dots, r, is (p+12)\binom{p+1}{2}, using the Pigeonhole Principle once again, we can guarantee that there exist AjαA_{j_\alpha} and AjβA_{j_\beta}, with α,β{1,,r}\alpha, \beta \in \{1, \dots, r\}, in which color cc appears twice in each and in the same positions. That is, it is proved that in the plane z=0z = 0, and with values of the coordinate x{0,1,,p}x \in \{0, 1, \dots, p\} and of the coordinate y{0,1,,n}y \in \{0, 1, \dots, n\}, there exist four points
(i1,jα,0),(i2,jα,0)Ajα(i1,jβ,0),(i2,jβ,0)Ajβ (i_1, j_\alpha, 0), (i_2, j_\alpha, 0) \in A_{j_\alpha} \quad (i_1, j_\beta, 0), (i_2, j_\beta, 0) \in A_{j_\beta}
which are vertices of a rectangle (always with Sides Parallel to the Grid Edges: SPGE) and all four of the same color.

The number, mm, of ways to choose, in a grid of (p+1)×(n+1)(p+1) \times (n+1) points, four points that are vertices of an SPGE rectangle is the same as the number of ways to choose two values of the abscissa and two values of the ordinate, that is m=(p+12)(n+12)m = \binom{p+1}{2} \binom{n+1}{2}.

For each k{0,1,,p×m}k \in \{0, 1, \dots, p \times m\} we consider the grid Ak={(i,j,k)A;0ip,0jn}A^k = \{(i, j, k) \in A; 0 \le i \le p, 0 \le j \le n\}. We have pm+1pm + 1 grids and in each of them there are four points that share a color and are vertices of an SPGE rectangle. By the Pigeonhole Principle, there are at least p+1p+1 of these grids in which the four points of each one occupy the same positions with respect to their first two coordinates. Finally, again by the Pigeonhole Principle, there are (at least) two of these p+1p+1 grids such that the common color of the four vertices of one is the same as the common color of the four vertices of the other. Thus we have eight points of AA that share a color and are vertices of a right parallelepiped.

Source: MathNet, licensed CC-BY-4.0. Statement translated into English from es; metadata (topic, difficulty, ordering) added by this project.