Found problems: 54
2017 CIIM, Problem 6
Let $G$ be a simple, connected and finite grafo. A hunter and an invisible rabbit play in the graph $G$.
The rabbit is initially in a vertex $w_0$. In the $k$-th turn (for $k \geq 0$) the hunter picks freely a vertex $v_k$. If $v_k = w_k$, the rabbit is capture and the game ends. If not, the rabbit moves invisibly by an edge of $w_k$ to $w_{k+1}$ ($w_k$ and $w_{k+1}$ are adjacent and therefore distinct) and the game continues. The hunter knows these rules and the graph $G$. After the $k-$th turn he knows that $w_k \not = v_k$, but he gets no more information.
Characterize the graphs $G$ such that the hunter has an strategy that guaranties that he can capture the rabbit in at most $N$ turns for some positive integer $N$. Here $N$ must depend only on $G$ and the strategy should work independently of the initial position and trajectory of the rabbit.
2013 CIIM, Problem 2
Consider a polinomial $p \in \mathbb{R}[x]$ of degree $n$ and with no real roots. Prove that $$\int_{-\infty}^{\infty}\frac{(p'(x))^2}{(p(x))^2+(p'(x))^2}dx$$ converges, and is less or equal than $n^{3/2}\pi.$
2014 CIIM, Problem 6
a) Let $\{x_n\}$ be a sequence with $x_n \in [0,1]$ for any $n$. Prove that there exists $C > 0$ such that for every positive integer $r$, there exists $m \geq 1$ and $n > m + r$ that satisfy $(n-m)|x_n-x_m| \leq C$.
b) Prove that for every $C > 0$, there exists a sequence $\{x_n\}$ with $x_n \in [0,1]$ for all $n$ and an integer $r$ such that, if $m \geq 1$ and $n > m+r$, then $(n-m)|x_n-x_m| > C.$
2015 CIIM, Problem 3
Consider the matrices $$A = \left(\begin{matrix} 1 & 2 \\ 0 & 1 \end{matrix}\right) \\ \mbox{ and } \\ B = \left(\begin{matrix} 1 & 0 \\ 2 & 1 \end{matrix}\right).$$
Let $k\geq 1$ an integer. Prove that for any nonzero $i_1,i_2,\dots,i_{k-1},j_1,j_2,\dots,j_k$ and any integers $i_0,i_k$ it holds that $$A^{i_0}B^{j_1}A^{i_1}B^{j_2}\cdots A^{i_{k-1}}B^{i_k}A^{i_k} \not = I.$$
2015 CIIM, Problem 4
Let $f:\mathbb{R} \to \mathbb{R}$ a continuos function and $\alpha$ a real number such that $$\lim_{x\to\infty}f(x) = \lim_{x\to-\infty}f(x) = \alpha.$$
Prove that for any $r > 0,$ there exists $x,y \in \mathbb{R}$ such that $y-x = r$ and $f(x) = f(y).$
2011 CIIM, Problem 4
For $n \geq 3$, let $(b_0, b_1,..., b_{n-1}) = (1, 1, 1, 0, ..., 0).$ Let $C_n =
(c_{i, j})$ the $n \times n$ matrix defined by $c_{i, j} = b _{(j -i) \mod n}$. Show
that $\det (C_n) = 3$ if $n$ is not a multiple of 3 and $\det (C_n) = 0$ if $n$
is a multiple of 3.
2010 CIIM, Problem 4
Let $f:[0,1] \to [0,1]$ a increasing continuous function, diferentiable in $(0,1)$ and with derivative smaller than 1 in every point. The sequence of sets $A_1,A_2,A_3,\dots$ is define as: $A_1 = f([0,1])$, and for $n \geq 2, A_n = f(A_{n-1}).$ Prove that $\displaystyle \lim_{n\to+\infty} d(A_n) = 0$, where $d(A)$ is the diameter of the set $A$.
Note: The diameter of a set $X$ is define as $d(X) = \sup_{x,y\in X} |x-y|.$
2012 CIIM, Problem 4
Let $f(x) = \frac{\sin(x)}{x}$ Find $$ \lim_{T\to\infty}\frac{1}{T}\int_0^T\sqrt{1+f'(x)^2}dx.$$
2014 CIIM, Problem 4
Let $\{a_i\}$ be a strictly increasing sequence of positive integers. Define the sequence $\{s_k\}$ as $$s_k = \sum_{i=1}^{k}\frac{1}{[a_i,a_{i+1}]},$$ where $[a_i,a_{i+1}]$ is the least commun multiple of $a_i$ and $a_{i+1}$.
Show that the sequence $\{s_k\}$ is convergent.
2009 CIIM, Problem 3
Let $r > n$ be positive integers. A "good word" is an $n$-tuple $\langle a_1,\dots, a_n \rangle$ of distinct positive integers between 1 and $r$. A "play" consist of changing a integer $a_i$ of a good word, in such a way that the resulting word is still a good word. The distance between two good words $A= \langle a_1,\dots, a_n \rangle$ and $B = \langle b_1,\dots, b_n \rangle$ is the minimun number of plays needed to obtain B from A. Find the maximun posible distance between two good words.
2014 CIIM, Problem 1
Let $g:[2013,2014]\to\mathbb{R}$ a function that satisfy the following two conditions:
i) $g(2013)=g(2014) = 0,$
ii) for any $a,b \in [2013,2014]$ it hold that $g\left(\frac{a+b}{2}\right) \leq g(a) + g(b).$
Prove that $g$ has zeros in any open subinterval $(c,d) \subset[2013,2014].$
2014 Contests, Problem 3
Given $n\geq2$, let $\mathcal{A}$ be a family of subsets of the set $\{1,2,\dots,n\}$ such that, for any $A_1,A_2,A_3,A_4 \in \mathcal{A}$, it holds that $|A_1 \cup A_2 \cup A_3 \cup A_4| \leq n -2$.
Prove that $|\mathcal{A}| \leq 2^{n-2}.$
2010 CIIM, Problem 3
A set $X\subset \mathbb{R}$ has dimension zero if, for any $\epsilon > 0$ there exists a positive integer $k$ and intervals $I_1,I_2,...,I_k$ such that $X \subset I_1 \cup I_2 \cup \cdots \cup I_k$ with $\sum_{j=1}^k |I_j|^{\epsilon} < \epsilon$.
Prove that there exist sets $X,Y \subset [0,1]$ both of dimension zero, such that $X+Y = [0,2].$
2013 CIIM, Problem 4
Let $a_1,b_1,c_1,a_2,b_2,c_2$ be positive real number and $F,G:(0,\infty)\to(0,\infty)$ be to differentiable and positive functions that satisfy the identities: $$\frac{x}{F} = 1 + a_1x+ b_1y + c_1G$$ $$\frac{y}{G} = 1 + a_2x+ b_2y + c_2F.$$
Prove that if $0 < x_1 \leq x_2$ and $0 < y_2 \leq y_1$, then $F(x_1,x_2) \leq F(x_2,y_2)$ and $G(x_1,y_1) \geq G(x_2,y_2).$
2018 CIIM, Problem 2
Let $p(x)$ and $q(x)$ non constant real polynomials of degree at most $n$ ($n > 1$). Show that there exists a non zero polynomial $F(x,y)$ in two variables with real coefficients of degree at most $2n-2,$ such that $F(p(t),q(t)) = 0$ for every $t\in \mathbb{R}$.
2014 Contests, Problem 4
Let $\{a_i\}$ be a strictly increasing sequence of positive integers. Define the sequence $\{s_k\}$ as $$s_k = \sum_{i=1}^{k}\frac{1}{[a_i,a_{i+1}]},$$ where $[a_i,a_{i+1}]$ is the least commun multiple of $a_i$ and $a_{i+1}$.
Show that the sequence $\{s_k\}$ is convergent.
2018 CIIM, Problem 6
Let $\{x_n\}$ be a sequence of real numbers in the interval $[0,1)$. Prove that there exists a sequence $1 < n_1 < n_2 < n_3 < \cdots$ of positive integers such that the following limit exists $$\lim_{i,j \to \infty} x_{n_i+n_j}. $$
That is, there exists a real number $L$ such that for every $\epsilon > 0,$ there exists a positive integer $N$ such that if $i,j > N$, then $|x_{n_i+n_j}-L| < \epsilon.$
2018 CIIM, Problem 3
Let $m$ be an integer and $\mathbb{Z}_m$ the set of integer modulo $m$. An equivalence relation is defined in $\mathbb{Z}_m$ given by, $x \sim y$ if there exists a natural $t$ such that $y \equiv 2^tx \, (\bmod m)$ . Find al values of $m$ such that the number of equivalent classes is even.
2015 CIIM, Problem 1
Find the real number $a$ such that the integral $$\int_a^{a+8}e^{-x}e^{-x^2}dx$$ attain its maximum.
2013 CIIM, Problem 6
Let $(X,d)$ be a metric space with $d:X\times X \to \mathbb{R}_{\geq 0}$. Suppose that $X$ is connected and compact. Prove that there exists an $\alpha \in \mathbb{R}_{\geq 0}$ with the following property: for any integer $n > 0$ and any $x_1,\dots,x_n \in X$, there exists $x\in X$ such that the average of the distances from $x_1,\dots,x_n$ to $x$ is $\alpha$ i.e. $$\frac{d(x,x_1)+d(x,x_2)+\cdots+d(x,x_n)}{n} = \alpha.$$
2013 CIIM, Problem 1
Given two natural numbers $m$ and $n$, denote by $\overline{m.n}$ the number obtained by writing $m$ followed by $n$ after the decimal dot.
a) Prove that there are infinitely many natural numbers $k$ such that for any of
them the equation $\overline{m.n} \times \overline{n.m} = k$ has no solution.
b) Prove that there are infinitely many natural numbers $k$ such that for any of
them the equation $\overline{m.n} \times \overline{n.m} = k$ has a solution.
2011 CIIM, Problem 5
Let $n$ be a positive integer with $d$ digits, all different from zero. For $k = 0,. . . , d - 1$, we define $n_k$ as the number obtained by moving the last $k$ digits of $n$ to the beginning. For example, if $n = 2184$ then $n_0 = 2184, n_1 = 4218, n_2 = 8421, n_3 = 1842$. For $m$ a positive integer, define $s_m(n)$ as the number of values $k$ such that $n_k$ is a multiple of $m.$ Finally, define $a_d$ as the number of integers $n$ with $d$ digits all nonzero, for which $s_2 (n) + s_3 (n) + s_5 (n) = 2d.$
Find \[\lim_{d \to \infty} \frac{a_d}{5^d}.\]
2015 CIIM, Problem 5
There are $n$ people seated on a circular table that have seats numerated from 1 to $n$ clockwise. Let $k$ be a fix integer with $2 \leq k \leq n$. The people can change their seats. There are two types of moves permitted:
1. Each person moves to the next seat clockwise.
2. Only the ones in seats 1 and $k$ exchange their seats.
Determine, in function of $n$ and $k$, the number of possible configurations of people in the table that can be attain by using a sequence of permitted moves.
2010 CIIM, Problem 6
A group is call locally cyclic if any finitely generated subgroup is cyclic. Prove that a locally cyclic group is isomorphic to one of its proper subgroups if and only if it's isomorphic to a proper subgroup of the rational numbers with the adition.
2017 CIIM, Problem 5
Let $\mathcal{S}$ be a set of integers. Given a real positive $r$, we say that $\mathcal{S}$ is a $r$-discerning, if for any pair $m, n > 1$ of distinct integers such that $\left| \frac{ m-n}{m+n} \right| < r$, there exists $a \in \mathcal{S}$ and $k \geq 1$ such that $a^k$ divides $m$ but not $n$, or $a^k$ divides $n$ but not $m$
1. Show that for every $r > 0$ every $r$-discerning set contains an infinite number of primes.
2. For every $r > 0$ determine the maximal possible cardinality of $\mathcal{P} \backslash \mathcal{S}$ where $\mathcal{P}$ is the set of primes and $\mathcal{S} \subseteq \mathcal{P}$ is a $r$-discerning set.