Problems(4)
board
Source: Ukraine 2005 grade 8
7/24/2009
A board is filled out with positive integers. Each move consists of selecting a square larger than , consisting of entire cells, and increasing all numbers inside the selected square by . Is it always possible to perform several moves so as to reach a situation where all numbers on the board are divisible by ?
combinatorics proposedcombinatorics
n points
Source: Ukraine 2005 grade 9
7/26/2009
On the plane are given points, not all on the same line. For any point on the same plane, is defined to be the sum of the distances from to these points. Suppose that there is a point such that for any point on the plane. Prove that if a point satisfies f(M_1)\equal{}f(M_2), then
inequalitiestriangle inequalitygeometry unsolvedgeometry
divisibility
Source: Ukraine 2005 grade 10
7/26/2009
An integer is divisible by . Suppose that every divisor of with equals the difference of two divisors of . Prove that is divisble by .
number theory unsolvednumber theory
intersection
Source: Ukraine 2005 grade 11
7/28/2009
In an acute-angled triangle , is the circumcircle and its center, the circumcircle of triangle , and the diameter of . Let and be points on the lines and respectively such that the quadrilateral is a parallelogram. Prove that the lines and intersect on .
geometrycircumcirclegeometry proposed