5
Problems(2)
Geometric Inequality
Source: 239 2008 S5
7/28/2020
In the triangle , , point is the midpoint of side . On the sides and , the points and are chosen such that . Prove that .
geometric inequalityinequalities
Checkered square
Source: 239 2008 J5
7/28/2020
You are given a checkered square, the side of which is long and contains nodes. A non-return path is a path along edges, the intersection of which with any horizontal or vertical line is a segment, point or empty set, and which does not pass along any edge more than once. What is the smallest number of non-return paths that can cover all the edges?
(An edge is a unit segment between adjacent nodes.)
combinatorics