2018年匈牙利大学生数学竞赛试题.pdfVIP

Problems posed in the 2018 Miklós Schweitzer Memorial Competition in Mathematics 26 October – 5 November 2018 1. Let be a closed set and be a continuous function. Let us define a graph as follows. Let be a vertex of iff and . We connect the vertices and by an edge in iff or Show that the chromatic number of is countable. 2. A family of sets is called really neat if for any there is a set such that . Let is really neat and Prove that the sequence converges and find its limit. 3. We call an matrix well groomed if it only contains the elements and , and it does not contain the submatrix . Show that there exists a constant such that every well groomed, matrix contains a submatrix of size at least such that all of the elements of the submatrix are equal. (A well groomed matrix may contain the submatrix .) 4. Let be a finite set of points in the plane. Assume that the distance between any two points is an integer. Prove that can be colored by three colors such that the distance between any two points of the same color is an even number. 5. For every positive integer , define where the sum is taken over all positive prime divisors of , and is the unique integer satisfying Find 6. Prove that if is an integer a