- Day 1
Prove that for any positive integer the number is an odd integer.
Iberoamerican Interuniversity Mathematics Competition 2009.
Prove that for any positive integer the number is an odd integer.
Determine if for all natural there is a matrix of real entries such that its determinant is 0 and that changing any entry produce another matrix with nonzero determinant.
Let be positive integers. A "good word" is an -tuple of distinct positive integers between 1 and . A "play" consist of changing a integer of a good word, in such a way that the resulting word is still a good word. The distance between two good words and is the minimun number of plays needed to obtain B from A. Find the maximun posible distance between two good words.
Let be a line in the plane and a point not in . Find the locus of the focus of the parabolas with vertex that are tangent to .
Let , such that
i) For all and all , exists such that ii) For all and all , exists with , such that and Prove that if there exists with or such that .
Let be an -th root of the unity and suppose is a real number where is some polinomial with integer coefficients. Prove there exists a polinomial with integer coefficients such that .