olymmath

BG-MO 2005

Bulgarian Mathematical Olympiad 2005.

Other problems

Problem 1

Determine all triples (x,y,z)\left( x,y,z\right) of positive integers for which the number 2005x+y+2005y+z+2005z+x\sqrt{\frac{2005}{x+y}}+\sqrt{\frac{2005}{y+z}}+\sqrt{\frac{2005}{z+x}} is an integer .

Problem 2

Consider two circles k1,k2k_{1},k_{2} touching externally at point TT . a line touches k2k_{2} at point XX and intersects k1k_{1} at points AA and BB . Let SS be the second intersection point of k1k_{1} with the line XTXT . On the arc TS^\widehat{TS} not containing AA and BB is chosen a point CC . Let  CY\ CY be the tangent line to k2k_{2} with Y∈k2Y\in k_{2} , such that the segment CYCY does not intersect the segment STST . If I=XY∩SCI=XY\cap SC . Prove that :

(a) the points C,T,Y,IC,T,Y,I are concyclic.

(b) II is the excenter of triangle ABCABC with respect to the side BCBC .

Problem 3

Let M=(0,1)∩QM=(0,1)\cap \mathbb Q . Determine, with proof, whether there exists a subset A⊂MA\subset M with the property that every number in MM can be uniquely written as the sum of finitely many distinct elements of AA .

Problem 4

Let ABCABC be a triangle with AC≠BCAC\neq BC , and let A′B′CA^{\prime }B^{\prime }C be a triangle obtained from ABCABC after some rotation centered at CC . Let M,E,FM,E,F be the midpoints of the segments BA′,ACBA^{\prime },AC and CB′CB^{\prime } respectively. If EM=FMEM=FM , find EMF^\widehat{EMF} .

Problem 5

For positive integers t,a,b,t,a,b, a (t,a,b)(t,a,b) -game is a two player game defined by the following rules. Initially, the number tt is written on a blackboard. At his first move, the 1st player replaces tt with either t−at-a or t−bt-b . Then, the 2nd player subtracts either aa or bb from this number, and writes the result on the blackboard, erasing the old number. After this, the first player once again erases either aa or bb from the number written on the blackboard, and so on. The player who first reaches a negative number loses the game. Prove that there exist infinitely many values of tt for which the first player has a winning strategy for all pairs (a,b)(a,b) with a+b=2005a+b=2005 .

Problem 6

Let a,ba,b and cc be positive integers such that abab divides c(c2−c+1)c(c^{2}-c+1) and a+ba+b is divisible by c2+1c^{2}+1 . Prove that the sets {a,b}\{a,b\} and {c,c2−c+1}\{c,c^{2}-c+1\} coincide.