olymmath

CZ-SK-MO 2010

Czech-Slovak Mathematical Olympiad 2010.

Other problems

Problem 1

Determine all pairs of integers a,ba, b for which they apply 4a+4a2+4=b24^a + 4a^2 + 4 = b^2 .

Problem 2

A circular target with a radius of 1212 cm was hit by 1919 shots. Prove that the distance between two hits is less than 77 cm.

Problem 3

Rumburak kidnapped 3131 members of party AA , 2828 members of party BB , 2323 members of party CC , 1919 members of Party DD and each of them in a separate cell. After work out occasionally they could walk in the yard and talk. Once three people started to talk to each other members of three different parties, Rumburak re-registered them to the fourth party as a punishment.(They never talked to each other more than three kidnapped.) a) Could it be that after some time all were abducted by members of one party? Which? b) Determine all four positive integers of which the sum is 101101 and which as the numbers of kidnapped members of the four parties allow the Rumburaks all of them became members of one party over time.

Problem 4

A circle kk is given with a non-diameter chord ACAC . On the tangent at point AA select point X≠AX \ne A and mark DD the intersection of the circle kk with the interior of the line XCXC (if any). Let BB a point in circle kk such that quadrilateral ABCDABCD is a trapezoid . Determine the set of intersections of lines BCBC and ADAD belonging to all such trapezoids.

Problem 5

On the board are written numbers 1,2,...,331, 2,. . . , 33 . In one step we select two numbers written on the product of which is the square of the natural number, we wipe off the two chosen numbers and write the square root of their product on the board. This way we continue to the board only the numbers remain so that the product of neither of them is a square. (In one we can also wipe out two identical numbers and replace them with the same number.) Prove that at least 1616 numbers remain on the board.

Problem 6

Find the minimum of the expression a+b+c2−[a,b]+[b,c]+[c,a]a+b+c\frac{a + b + c}{2} -\frac{[a, b] + [b, c] + [c, a]}{a + b + c} where the variables a,b,ca, b, c are any integers greater than 11 and [x,y][x, y] denotes the least common multiple of numbers x,yx, y .