olymmath

CIIM 2013

Iberoamerican Interuniversity Mathematics Competition 2013.

Day 1

Problem 1

  • Day 1

Given two natural numbers mm and nn , denote by m.n‾\overline{m.n} the number obtained by writing mm followed by nn after the decimal dot.

a) Prove that there are infinitely many natural numbers kk such that for any of them the equation m.n‾×n.m‾=k\overline{m.n} \times \overline{n.m} = k has no solution.

b) Prove that there are infinitely many natural numbers kk such that for any of them the equation m.n‾×n.m‾=k\overline{m.n} \times \overline{n.m} = k has a solution.

Answer, solutions and source

Problem 2

  • Day 1

Consider a polinomial p∈R[x]p \in \mathbb{R}[x] of degree nn and with no real roots. Prove that ∫−∞∞(p′(x))2(p(x))2+(p′(x))2dx\int_{-\infty}^{\infty}\frac{(p'(x))^2}{(p(x))^2+(p'(x))^2}dx converges, and is less or equal than n3/2π.n^{3/2}\pi.

Answer, solutions and source

Problem 3

  • Day 1

Given a set of boys and girls, we call a pair (A,B)(A,B) amicable if AA and BB are friends. The friendship relation is symmetric. A set of people is affectionate if it satisfy the following conditions:

i) The set has the same number of boys and girls.

ii) For every four different people A,B,C,DA,B,C,D if the pairs (A,B),(B,C),(C,D)(A,B),(B,C),(C,D) and (D,A)(D,A) are all amicable, then at least one of the pairs (A,C)(A,C) and (B,D)(B,D) is also amicable. iii) At least 12013\frac{1}{2013} of all boy-girl pairs are amicable.

Let mm be a positive integer. Prove that there exists an integer N(m)N(m) such that if a affectionate set has al least N(m)N(m) people, then there exists mm boys that are pairwise friends or mm girls that are pairwise friends.

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Let a1,b1,c1,a2,b2,c2a_1,b_1,c_1,a_2,b_2,c_2 be positive real number and F,G:(0,∞)→(0,∞)F,G:(0,\infty)\to(0,\infty) be to differentiable and positive functions that satisfy the identities: xF=1+a1x+b1y+c1G\frac{x}{F} = 1 + a_1x+ b_1y + c_1G yG=1+a2x+b2y+c2F.\frac{y}{G} = 1 + a_2x+ b_2y + c_2F. Prove that if 0<x1≤x20 < x_1 \leq x_2 and 0<y2≤y10 < y_2 \leq y_1 , then F(x1,x2)≤F(x2,y2)F(x_1,x_2) \leq F(x_2,y_2) and G(x1,y1)≥G(x2,y2).G(x_1,y_1) \geq G(x_2,y_2).

Answer, solutions and source

Problem 5

  • Day 2

Let A,BA,B be n×nn\times n matrices with complex entries. Show that there exists a matrix TT and an invertible matrix SS such that B=S(A+T)S−1 −T  ⟺  tr⁡(A)=tr⁡(B)B=S(A+T)S^{-1}\ -T \iff \operatorname{tr}(A) = \operatorname{tr}(B)

Answer, solutions and source

Problem 6

  • Day 2

Let (X,d)(X,d) be a metric space with d:X×X→R≥0d:X\times X \to \mathbb{R}_{\geq 0} . Suppose that XX is connected and compact. Prove that there exists an α∈R≥0\alpha \in \mathbb{R}_{\geq 0} with the following property: for any integer n>0n > 0 and any x1,…,xn∈Xx_1,\dots,x_n \in X , there exists x∈Xx\in X such that the average of the distances from x1,…,xnx_1,\dots,x_n to xx is α\alpha i.e. d(x,x1)+d(x,x2)+⋯+d(x,xn)n=α.\frac{d(x,x_1)+d(x,x_2)+\cdots+d(x,x_n)}{n} = \alpha.

Answer, solutions and source