olymmath

IL-GROSSMAN 1995

Grossman Olympiad 1995.

Other problems

Problem 1

Positive integers d1,d2,...,dnd_1,d_2,...,d_n are divisors of 19951995 . Prove that there exist did_i and djd_j among them, such the denominator of the reduced fraction di/djd_i/d_j is at least nn

Problem 2

Two players play a game on an infinite board that consists of unit squares. Player II chooses a square and marks it with OO . Then player IIII chooses another square and marks it with XX . They play until one of the players marks a whole row or a whole column of five consecutive squares, and this player wins the game. If no player can achieve this, the result of the game is a tie. Show that player IIII can prevent player II from winning.

Problem 3

Two thieves stole an open chain with 2k2k white beads and 2m2m black beads. They want to share the loot equally, by cutting the chain to pieces in such a way that each one gets kk white beads and mm black beads. What is the minimal number of cuts that is always sufficient?

Problem 4

Two given circles α\alpha and β\beta intersect each other at two points. Find the locus of the centers of all circles that are orthogonal to both α\alpha and β\beta .