uIcMoP 2015-09-25 Problems Problem 1. Prove that for n > 100 Problem 2. Vertices of a convex polygon are colored using 3 colors so that adjacent vertices never have the same color, and all three colors are used. Prove that one can choose some diagonals so that the polygon is divided into triangles, each of which has vertices of all three colors. Problem 3. Prove that any map in plane that is drawn only using circles and straight lines can be colored using only two colors, so that any two regions having a common border (a segment or an arc) have different, colors. Problem 4. Let n be a natural number. Take a sogment of length 3", divide it into three equal parts (of length 3"-* each), and consider the first and the third as "selected”. Then continne with each one of the two selected segments: divide them into three equal parts (of length 3°-? each), select the first ones and the third ones, and continue with each one of them. After n steps we stop with 2" selected intervals of length 1 each. Mark all the end points of the selected intervals. Prove that for every integer k in the range 1 < k <3” one can find two marked points at distance exactly &. Problem 5, Consider the following crowd ranking procedure: A large group of people is trying to compare candidates O;,..., On as follows - Each person submits her/his ranking of the candidates. - For each pair 1 < i # j 2 there is NV so that for any choice of an outcome for each pair C;,C; (ue. Ci beats Cj, or Cj beats Cj, or they tie) one can find N ways to rank Ci,...,Cn that give the chosen outcomes in each pair C,C; uicmop. wordpress.comUICMOP 2015-11-20 Problem 1, Imagine a cube and numbers associated to its vertices, We start with one 1 and seven 0. For each edge one is allowed to add one to both of its vertices. (a) Is it possible to achieve the situation where all vertices have the same value? (b) Is it possible to achieve the situation where all vertices are divisible by 3? Problem 2. Imagine a 10 x 10 x 10 block built of small 1 x 1 x 1 cubes (minecraft?) where one can go from one cube to an adjacent ones (those sharing a face). How many paths are there from a corner cube to the opposite corner where the distance from the origin never decreases? Problem 3. For what values of n does the polynomial p(c) divide g(z) where Plt tetl, — ale) tot¢e? 41 P(z) Problem 4. Consider the irrational number (5 -+ ¥36)"""5. Prove that the first 2015 digits after ‘the decimal point in its expansion are identical. Problem 5. Vertices of some finite graph are colored in two colors: blue and red. A vertex is called special if more than half of its neighbors have a color different from its own. An allowed ove is to change the color of a special vertex into the color of the majority of its neighbors. Prove that the process of recoloring will always terminate (so there are no more special vertices). Problem 6. Let O be a circle of radius r, P a point at distance d > r from the center of O, and A,B two points of intersection of the circle O with a line through P. ‘Compute the product of lengths PA- PB in terms of d and r. Problem 7. Imagine a triangle ABC inscribed in a circle O. Continue the median, the angle bisector, and the height from vertex A until they intersect the circle and mark the resulting points M,N,L. Assuming these threo points are distinet, reconstruct ABC and the circle just from MN,L. jemop.wordpress.comUICMOP 2015-09-25 A bit of theory... Recall that the Buclidian Algorithm for finding the greatest common divisor ged(a,}) of two integers a,b is based on the division with remainder: for two natural numbers a,b there are q and r € {0,...,b—1} so that a = bg +r. The Euclidean Algorithm can be used to prove: ‘Theorem 1 Given any two natural numbers a,b one can find integers x,y so that ax + by ged(a,b). Corollary 2 If a prime p divides ab, then p divides a, or b, or both. Recall modulo arithmetic, where operations of addition and multiplication are defined for the set of remainders {0,1,...,n—1} modulo n. For example, 5-7 =3 mod 8. Theorem 3 Leta and n be relatinely prime natural numbers, Then there exists « € {1,....m—1} 50 that a-2=1 mod n, and for any b there is y so that a-y=b mod n. ‘There is also division with remainder for polynomials: given polynomials afz) sags" $-s-tme ton, (2) baw +--+ +b + bo with ay #0 and bm # 0 (so deg(a) = n and deg(b) = m), one can find polynomials q(x) and r(z) so that, a(x) =6(2)-9(c) +r(2), — deg(r) < deg(). For example: for a(x) = 2* — 1 and (2) = 2? +2+1 one gets -1= (2? +2+41)(@?-z)+ (2-1). Note that deg(x — 1) = 1 <2 = dex(z? +241). One can talk about one polynomial dividing another, like x — 1 divides 2 — 1, and one can define ged of two polynomials. ‘Theorem 4 Given any two polynomials a(x), 6(2) one can find polynomials p(z), q(z) so that a(z)p(2) + b(x)a(x) = tx), where t(2) is the polynomial of maximal degree that divides both a(ze) and (2). If a(z) and (zc) have no common divisors except for constants, one can. find polynomials p(x),q(z) so that a(2)p(@) + 6(z)a(z) = 1. In the above discussion, one can work with real polynomials (i.e. polynomials with real coefficients), or complex, or rational ones. The process of division of polynomials with remainder does not take one out of their field of coefficients (rational/real). Therefore we get the following surprising Corollary 5 If-a(e) and 6() are rational polynomials (resp. real polynomials), and t(z) is their GCD among complex polynomials, then t(2) %s proportional to a rational polynomial (resp. real polynomial). uicmop.wordpress.com