olymmath

OIMU 2006

Iberoamerican Olympiad for University Students 2006.

Other problems

Problem 1

Let m,nm,n be positive integers greater than 11 . We define the sets Pm={1m,2m,⋯ ,m−1m}P_m=\left\{\frac{1}{m},\frac{2}{m},\cdots,\frac{m-1}{m}\right\} and Pn={1n,2n,⋯ ,n−1n}P_n=\left\{\frac{1}{n},\frac{2}{n},\cdots,\frac{n-1}{n}\right\} .

Find the distance between PmP_m and PnP_n , that is defined as min⁡{∣a−b∣:a∈Pm,b∈Pn}\min\{|a-b|:a\in P_m,b\in P_n\}

Problem 2

Prove that for any positive integer nn and any real numbers a1,a2,⋯ ,an,b1,b2,⋯ ,bna_1,a_2,\cdots,a_n,b_1,b_2,\cdots,b_n we have that the equation a1sin⁡(x)+a2sin⁡(2x)+⋯+ansin⁡(nx)=b1cos⁡(x)+b2cos⁡(2x)+⋯+bncos⁡(nx)a_1 \sin(x) + a_2 \sin(2x) +\cdots+a_n\sin(nx)=b_1 \cos(x)+b_2\cos(2x)+\cdots +b_n \cos(nx) has at least one real root.

Problem 3

Let p1(x)=p(x)=4x3−3xp_1(x)=p(x)=4x^3-3x and pn+1(x)=p(pn(x))p_{n+1}(x)=p(p_n(x)) for each positive integer nn . Also, let A(n)A(n) be the set of all the real roots of the equation pn(x)=xp_n(x)=x .

Prove that A(n)⊆A(2n)A(n)\subseteq A(2n) and that the product of the elements of A(n)A(n) is the average of the elements of A(2n)A(2n) .

Problem 4

Prove that for any interval [a,b][a,b] of real numbers and any positive integer nn there exists a positive integer kk and a partition of the given interval a=x(0)<x(1)<x(2)<⋯<x(k−1)<x(k)=ba = x (0) < x (1) < x (2) < \cdots < x (k-1) < x (k) = b such that ∫x(0)x(1)f(x)dx+∫x(2)x(3)f(x)dx+⋯=∫x(1)x(2)f(x)dx+∫x(3)x(4)f(x)dx+⋯\int_{x(0)}^{x(1)}f(x)dx+\int_{x(2)}^{x(3)}f(x)dx+\cdots=\int_{x(1)}^{x(2)}f(x)dx+\int_{x(3)}^{x(4)}f(x)dx+\cdots for all polynomials ff with real coefficients and degree less than nn .

Problem 5

A regular nn -gon is inscribed in a circle of radius 11 . Let a1,⋯ ,an−1a_1,\cdots,a_{n-1} be the distances of one of the vertices of the polygon to all the other vertices. Prove that (5−a12)⋯(5−an−12)=Fn2(5-a_1^2)\cdots(5-a_{n-1}^2)=F_n^2 where FnF_n is the nthn^{th} term of the Fibonacci sequence 1,1,2,⋯1,1,2,\cdots

Problem 6

Let x0(t)=1x_0(t)=1 , xk+1(t)=(1+tk+1)xk(t)x_{k+1}(t)=(1+t^{k+1})x_k(t) for all k≥0k\geq 0 ; yn,0(t)=1y_{n,0}(t)=1 , yn,k(t)=tn−k+1−1tk−1yn,k−1(t)y_{n,k}(t)=\frac{t^{n-k+1}-1}{t^k-1}y_{n,k-1}(t) for all n≥0n\geq 0 , 1≤k≤n1\leq k \leq n .

Prove that ∑j=0n−1(−1)jxn−j−1(t)yn,j(t)=1−(−1)n2\sum_{j=0}^{n-1}(-1)^j x_{n-j-1}(t)y_{n,j}(t)=\frac{1-(-1)^n}{2} for all n≥1n\geq 1 .

Problem 7

Consider the multiplicative group A={z∈C∣z2006k=1,0<k∈Z}A=\{z\in\mathbb{C}|z^{2006^k}=1, 0<k\in\mathbb{Z}\} of all the roots of unity of degree 2006k2006^k for all positive integers kk .

Find the number of homomorphisms f:A→Af:A\to A that satisfy f(f(x))=f(x)f(f(x))=f(x) for all elements x∈Ax\in A .