olymmath

PL-OM 1983

Polish Mathematical Olympiad 1983.

Other problems

Problem 1

On the plane are given a convex nn -gon P1P2....PnP_1P_2....P_n and a point QQ inside it, not lying on any of its diagonals. Prove that if nn is even, then the number of triangles PiPjPkP_iP_jP_k containing the point QQ is even.

Problem 2

Let be given an irrational number aa in the interval (0,1)(0,1) and a positive integer NN . Prove that there exist positive integers p,q,r,sp,q,r,s such that pq<a<rs,rs−pq<1N\frac{p}{q} < a <\frac{r}{s}, \frac{r}{s} -\frac{p}{q}<\frac{1}{N} , and rq−ps=1rq- ps = 1 .

Problem 3

Consider the following one-player game on an infinite chessboard. If two horizontally or vertically adjacent squares are occupied by a pawn each, and a square on the same line that is adjacent to one of them is empty, then it is allowed to remove the two pawns and place a pawn on the third (empty) square. Prove that if in the initial position all the pawns were forming a rectangle with the number of squares divisible by 33 , then it is not possible to end the game with only one pawn left on the board.

Problem 4

Prove that if natural numbers a,b,c,da,b,c,d satisfy the equality ab=cdab = cd , then gcd(a,c)gcd(a,d)gcd(a,b,c,d)=a\frac{gcd(a,c)gcd(a,d)}{gcd(a,b,c,d)}= a

Problem 5

On the plane are given unit vectors a1→,a2→,a3→\overrightarrow{a_1},\overrightarrow{a_2},\overrightarrow{a_3} . Show that one can choose numbers c1,c2,c3∈{−1,1}c_1,c_2,c_3 \in \{-1,1\} such that the length of the vector c1a1→+c2a2→+c3a3→c_1\overrightarrow{a_1}+c_2\overrightarrow{a_2}+c_3\overrightarrow{a_3} is at least 22 .

Problem 6

Prove that if all dihedral angles of a tetrahedron are acute, then all its faces are acute-angled triangles.