September 14, 2026 · Problem sheet · LibreTimes
IMO 1991
Day 1
Problem 1. Given a triangle , let , be the center of its inscribed circle. The internal bisectors of the angles , meet the opposite sides in respectively. Prove that
Problem 2. Let , be an integer and , be all the natural numbers less than and relatively prime to . If
prove that , must be either a prime number or a power of .
Problem 3. Let . Find the smallest integer such that each -element subset of contains five numbers which are pairwise relatively prime.
Day 2
Problem 4. Suppose , is a connected graph with , edges. Prove that it is possible to label the edges , in such a way that at each vertex which belongs to two or more edges, the greatest common divisor of the integers labeling those edges is equal to 1.
[A graph/ consists of a set of points, called vertices/, together with a set of edges/ joining certain pairs of distinct vertices. Each pair of vertices , belongs to at most one edge. The graph is connected/ if for each pair of distinct vertices , there is some sequence of vertices , such that each pair , is joined by an edge of .]
Problem 5. Let , be a triangle and , an interior point of ,. Show that at least one of the angles is less than or equal to .
Problem 6. An infinite sequence of real numbers is said to be bounded/ if there is a constant , such that , for every .
Given any real number , construct a bounded infinite sequence such that
for every pair of distinct nonnegative integers .
No comments yet
Be the first to share your thoughts.