Maths Olympiad Prep

Library / Romanian Mathematical Olympiad - Final Round /16 of 37

Romanian Mathematical Olympiad - Final Round

Geometry Difficulty 5.8 AIME, harder Prove it Romania

Consider a tetrahedron ABCDABCD and the points M,NM, N on the edges ACAC and BDBD, respectively. Prove that for any point PP of the segment MNMN, P≠MP \neq M, P≠NP \neq N, there exists a unique pair of points (X,Y)(X, Y), with XX and YY on the edges ABAB and CDCD, respectively, such that the points X,PX, P and YY are collinear.

Solution

Since P≠MP \neq M and P≠NP \neq N, if X,Y,PX, Y, P are collinear, we have X∉{A,B}X \notin \{A, B\} and Y∉{C,D}Y \notin \{C, D\}. Indeed, if X=AX = A, then XY⊂(ACD)XY \subset (ACD) and thus P∈(ACD)P \in (ACD), false. The other situations are analogous.

2023 ROMANIAN MATHEMATICAL OLYMPIAD – FINAL ROUND

Existence: Since P∈(MN)P \in (MN), the point PP lies in the interior of the triangle ANCANC. Denote {Q}=AP∩CN\{Q\} = AP \cap CN.
From (CN)⊂Int(BCD)(CN) \subset \text{Int}(BCD), it follows that Q∈Int(BCD)Q \in \text{Int}(BCD), thus the line BQBQ intersects the open segment CDCD. Denote {Y}=BQ∩(CD)\{Y\} = BQ \cap (CD). Because P∈(AQ)⊂(ABY)P \in (AQ) \subset (ABY), we deduce that PP lies in the interior of the triangle ABYABY, thus the line YPYP intersects the open segment ABAB. Denote {X}=PY∩(AB)\{X\} = PY \cap (AB). The pair (X,Y)(X, Y) satisfies the statement.

Uniqueness: Assume that a pair of points (X′,Y′)(X', Y') exists, with X′∈(AB)X' \in (AB), Y′∈(CD)Y' \in (CD), (X,Y)≠(X′,Y′)(X, Y) \neq (X', Y'), such that the points X′X', PP and Y′Y' are collinear. We consider Y′≠YY' \neq Y (the situation X′≠XX' \neq X is analogous). If X′=XX' = X, then Y′∈XP∩CDY' \in XP \cap CD, therefore Y′=YY' = Y, false. Consequently X′≠XX' \neq X, so the distinct straight lines XYXY and X′Y′X'Y' intersect at PP. If α=(XY,X′Y′)\alpha = (XY, X'Y'), we obtain XX′=AB⊂αXX' = AB \subset \alpha and YY′=CD⊂αYY' = CD \subset \alpha, thus the points A,B,CA, B, C and DD are coplanar, false. Consequently, the pair (X,Y)(X, Y) is unique.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.