Found problems: 163
2019 IMC, 4
Let $(n+3)a_{n+2}=(6n+9)a_{n+1}-na_n$ and $a_0=1$ and $a_1=2$ prove that all the terms of the sequence are integers
1994 IMC, 2
Let $f\colon \mathbb R ^2 \rightarrow \mathbb R$ be given by $f(x,y)=(x^2-y^2)e^{-x^2-y^2}$.
a) Prove that $f$ attains its minimum and its maximum.
b) Determine all points $(x,y)$ such that $\frac{\partial f}{\partial x}(x,y)=\frac{\partial f}{\partial y}(x,y)=0$ and determine for which of them $f$ has global or local minimum or maximum.
2005 IMC, 1
1. Let $f(x)=x^2+bx+c$, M = {x | |f(x)|<1}. Prove $|M|\leq 2\sqrt{2}$ (|...| = length of interval(s))
2017 IMC, 8
Define the sequence $A_1,A_2,\ldots$ of matrices by the following recurrence: $$ A_1 = \begin{pmatrix} 0 & 1 \\ 1 & 0 \\ \end{pmatrix}, \quad A_{n+1} = \begin{pmatrix} A_n & I_{2^n} \\ I_{2^n} & A_n \\ \end{pmatrix} \quad (n=1,2,\ldots) $$ where $I_m$ is the $m\times m$ identity matrix.
Prove that $A_n$ has $n+1$ distinct integer eigenvalues $\lambda_0< \lambda_1<\ldots <\lambda_n$ with multiplicities $\binom{n}{0},\binom{n}{1},\ldots,\binom{n}{n}$, respectively.
2014 IMC, 5
For every positive integer $n$, denote by $D_n$ the number of permutations $(x_1, \dots, x_n)$ of $(1,2,\dots, n)$ such that $x_j\neq j$ for every $1\le j\le n$. For $1\le k\le \frac{n}{2}$, denote by $\Delta (n,k)$ the number of permutations $(x_1,\dots, x_n)$ of $(1,2,\dots, n)$ such that $x_i=k+i$ for every $1\le i\le k$ and $x_j\neq j$ for every $1\le j\le n$. Prove that
$$\Delta (n,k)=\sum_{i=0}^{k=1} \binom{k-1}{i} \frac{D_{(n+1)-(k+i)}}{n-(k+i)}$$
(Proposed by Combinatorics; Ferdowsi University of Mashhad, Iran; Mirzavaziri)
2023 IMC, 7
Let $V$ be the set of all continuous functions $f\colon [0,1]\to \mathbb{R}$, differentiable on $(0,1)$, with the property that $f(0)=0$ and $f(1)=1$. Determine all $\alpha \in \mathbb{R}$ such that for every $f\in V$, there exists some $\xi \in (0,1)$ such that
\[f(\xi)+\alpha = f'(\xi)\]
1994 IMC, 2
Let $f\in C^1(a,b)$, $\lim_{x\to a^+}f(x)=\infty$, $\lim_{x\to b^-}f(x)=-\infty$ and $f'(x)+f^2(x)\geq -1$ for $x\in (a,b)$. Prove that $b-a\geq\pi$ and give an example where $b-a=\pi$.
2004 IMC, 4
Suppose $n\geq 4$ and let $S$ be a finite set of points in the space ($\mathbb{R}^3$), no four of which lie in a plane. Assume that the points in $S$ can be colored with red and blue such that any sphere which intersects $S$ in at least 4 points has the property that exactly half of the points in the intersection of $S$ and the sphere are blue. Prove that all the points of $S$ lie on a sphere.
2019 IMC, 8
Let $x_1,\ldots,x_n$ be real numbers. For any set $I\subset\{1,2,…,n\}$ let $s(I)=\sum_{i\in I}x_i$. Assume that the function $I\to s(I)$ takes on at least $1.8^n$ values where $I$ runs over all $2^n$ subsets of $\{1,2,…,n\}$. Prove that the number of sets $I\subset \{1,2,…,n\}$ for which $s(I)=2019$ does not exceed $1.7^n$.
[i]Proposed by Fedor Part and Fedor Petrov, St. Petersburg State University[/i]
2005 IMC, 6
6. If $ p,q$ are rationals, $r=p+\sqrt{7}q$, then prove there exists a matrix
$\left(\begin{array}{cc}a&b\\c&d\end{array}\right) \in M_{2}(Z)- ( \pm I_{2})$
for which $\frac{ar+b}{cr+d}=r$ and $det(A)=1$
2013 IMC, 2
Let $\displaystyle{p,q}$ be relatively prime positive integers. Prove that
\[\displaystyle{ \sum_{k=0}^{pq-1} (-1)^{\left\lfloor \frac{k}{p}\right\rfloor + \left\lfloor \frac{k}{q}\right\rfloor} = \begin{cases} 0 & \textnormal{ if } pq \textnormal{ is even}\\ 1 & \textnormal{if } pq \textnormal{ odd}\end{cases}}\]
[i]Proposed by Alexander Bolbot, State University, Novosibirsk.[/i]
2012 IMC, 1
Consider a polynomial
\[f(x)=x^{2012}+a_{2011}x^{2011}+\dots+a_1x+a_0.\]
Albert Einstein and Homer Simpson are playing the following game. In turn, they choose one of the coefficients $a_0,a_1,\dots,a_{2011}$ and assign a real value to it. Albert has the first move. Once a value is assigned to a coefficient, it cannot be changed any more. The game ends after all the coefficients have been assigned values.
Homer's goal is to make $f(x)$ divisible by a fixed polynomial $m(x)$ and Albert's goal is to prevent this.
(a) Which of the players has a winning strategy if $m(x)=x-2012$?
(b) Which of the players has a winning strategy if $m(x)=x^2+1$?
[i]Proposed by Fedor Duzhin, Nanyang Technological University.[/i]
2008 IMC, 3
Let $p$ be a polynomial with integer coefficients and let $a_1<a_2<\cdots <a_k$ be integers. Given that $p(a_i)\ne 0\forall\; i=1,2,\cdots, k$.
[list]
(a) Prove $\exists\; a\in \mathbb{Z}$ such that
\[ p(a_i)\mid p(a)\;\;\forall i=1,2,\dots ,k \]
(b) Does there exist $a\in \mathbb{Z}$ such that
\[ \prod_{i=1}^{k}p(a_i)\mid p(a) \][/list]