Found problems: 5802
Let $\mathbb Z$ be the set of integers. We consider functions $f :\mathbb Z\to\mathbb Z$ satisfying
\[f\left(f(x+y)+y\right)=f\left(f(x)+y\right)\]
for all integers $x$ and $y$. For such a function, we say that an integer $v$ is [i]f-rare[/i] if the set
\[X_v=\{x\in\mathbb Z:f(x)=v\}\]
is finite and nonempty.
(a) Prove that there exists such a function $f$ for which there is an $f$-rare integer.
(b) Prove that no such function $f$ can have more than one $f$-rare integer.
[i]Netherlands[/i]
A series of numbers is called complete if it has non-zero natural terms and any nonzero integer has at least one among multiple series. Show that the arithmetic progression is a complete sequence if and only if it divides the first term relationship.
Prove that a finite simple planar graph has an orientation so that every vertex has out-degree at most 3.
Prove the following inequality:
$x_1 + 2x_2 + 3x_3 + ... + nx_n \leq \frac{n(n-1)}{2} + x_1 + x_2 ^2 + x_3 ^3 + ... + x_n ^n$
where $\forall _{x_i} x_i > 0$
There are $k$ piles of stones with $2020$ stones in each pile. Amber can choose any two non-empty piles of stones, and Barbara can take one stone from one of the two chosen piles and puts it into the other pile. Amber wins if she can eventually make an empty pile. What is the least $k$ such that Amber can always win?
Let $n$ be a positive integer. Given is a subset $A$ of $\{0,1,...,5^n\}$ with $4n+2$ elements. Prove that there exist three elements $a<b<c$ from $A$ such that $c+2a>3b$.
[i]Proposed by Dominik Burek and Tomasz Ciesla, Poland[/i]
A house has an even number of lamps distributed among its rooms in such a way that there are at least three lamps in every room. Each lamp shares a switch with exactly one other lamp, not necessarily from the same room. Each change in the switch shared by two lamps changes their states simultaneously. Prove that for every initial state of the lamps there exists a sequence of changes in some of the switches at the end of which each room contains lamps which are on as well as lamps which are off.
[i]Proposed by Australia[/i]
Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.
Let $(a_n)_n\geq 0$ and $a_{m+n}+a_{m-n}=\frac{1}{2}(a_{2m}+a_{2n})$ for every $m\geq n\geq0.$ If $a_1=1,$ then find the value of $a_{2007}.$
The Fibonacci sequence $\{F_{n}\}$ is defined by \[F_{1}=1, \; F_{2}=1, \; F_{n+2}=F_{n+1}+F_{n}.\] Show that $F_{mn-1}-F_{n-1}^{m}$ is divisible by $F_{n}^{2}$ for all $m \ge 1$ and $n>1$.
Consider a function $f: \mathbb Z \to \mathbb Z$ such that for every integer $n \ge 0$, there are at most $0.001n^2$ pairs of integers $(x,y)$ for which $f(x+y) \neq f(x)+f(y)$ and $\max\{ \lvert x \rvert, \lvert y \rvert \} \le n$. Is it possible that for some integer $n \ge 0$, there are more than $n$ integers $a$ such that $f(a) \neq a \cdot f(1)$ and $\lvert a \rvert \le n$?
[i]Proposed by David Yang[/i]
Consider an arrangement of tokens in the plane, not necessarily at distinct points. We are allowed to apply a sequence of moves of the following kind: select a pair of tokens at points $A$ and $B$ and move both of them to the midpoint of $A$ and $B$.
We say that an arrangement of $n$ tokens is [i]collapsible[/i] if it is possible to end up with all $n$ tokens at the same point after a finite number of moves. Prove that every arrangement of $n$ tokens is collapsible if and only if $n$ is a power of $2$.
Let $a_0, a_1, \ldots , a_n$ and $b_0, b_1, \ldots , b_n$ be sequences of real numbers such that $a_0 = b_0 \geqslant 0$, $a_n = b_n > 0$ and \[a_i=\sqrt{\frac{a_{i+1}+a_{i-1}}{2}},\quad b_i=\sqrt{\frac{b_{i+1}+b_{i-1}}{2}},\]for all $i=1,\ldots,n-1$. Prove that $a_1 = b_1$.
Consider the sequence $(a_n)_{n\ge 1}$ such that $a_1=1$ and $a_{n+1}=\sqrt{a_n+n^2}$, $\forall n\ge 1$.
$\textbf{(a)}$ Prove that there is exactly one rational number among the numbers $a_1,a_2,a_3,\dots$.
$\textbf{(b)}$ Consider the sequence $(S_n)_{n\ge 1}$ such that
$$S_n=\sum_{i=1}^n\frac{4}{\left (\left \lfloor a_{i+1}^2\right \rfloor-\left \lfloor a_i^2\right \rfloor\right)\left(\left \lfloor a_{i+2}^2\right \rfloor-\left \lfloor a_{i+1}^2\right \rfloor\right)}.$$
Prove that there exists an integer $N$ such that $S_n>0.9$, $\forall n>N$.
[i] (Stefan Obadă)[/i]
Determine all positive integers $a$, $b$, $c$, $p$, where $p$ and $p+2$ are odd primes and
\[2^ap^b=(p+2)^c-1.\]
Let $n$ be a fixed positive odd integer. Take $m+2$ [b]distinct[/b] points $P_0,P_1,\ldots ,P_{m+1}$ (where $m$ is a non-negative integer) on the coordinate plane in such a way that the following three conditions are satisfied:
1) $P_0=(0,1),P_{m+1}=(n+1,n)$, and for each integer $i,1\le i\le m$, both $x$- and $y$- coordinates of $P_i$ are integers lying in between $1$ and $n$ ($1$ and $n$ inclusive).
2) For each integer $i,0\le i\le m$, $P_iP_{i+1}$ is parallel to the $x$-axis if $i$ is even, and is parallel to the $y$-axis if $i$ is odd.
3) For each pair $i,j$ with $0\le i<j\le m$, line segments $P_iP_{i+1}$ and $P_jP_{j+1}$ share at most $1$ point.
Determine the maximum possible value that $m$ can take.
Determine all functions $f: \mathbb N\to \mathbb N$ such that for every positive integer $n$ we have: \[ 2n+2001\leq f(f(n))+f(n)\leq 2n+2002. \]
Let $P(x)$ be a polynomial with integer coefficients such that $P(0)=1$, and let $c > 1$ be an integer. Define $x_0=0$ and $x_{i+1} = P(x_i)$ for all integers $i \ge 0$. Show that there are infinitely many positive integers $n$ such that $\gcd (x_n, n+c)=1$.
[i]Proposed by Milan Haiman and Carl Schildkraut[/i]
Given is a function $f:\mathbb{R}\rightarrow \mathbb{R}$ such that $|f(x+y)-f(x)-f(y)|\leq 1$.
Prove the existence of an additive function $g:\mathbb{R}\rightarrow \mathbb{R}$ (that is $g(x+y)=g(x)+g(y)$) such that $|f(x)-g(x)|\leq 1$ for any $x \in \mathbb{R}$
Let $n \ge 2$ be a positive integer. Each square of an $n\times n$ board is coloured red or blue. We put dominoes on the board, each covering two squares of the board. A domino is called [i]even [/i] if it lies on two red or two blue squares and [i]colourful [/i] if it lies on a red and a blue square. Find the largest positive integer $k$ having the following property: regardless of how the red/blue-colouring of the board is done, it is always possible to put $k$ non-overlapping dominoes on the board that are either all [i]even [/i] or all [i]colourful[/i].
The sequence of real numbers $(a_n)_{n\geq 0}$ is such that $a_0 = 1$, $a_1 = a > 2$ and $\displaystyle a_{n+1} = \left(\left(\frac{a_n}{a_{n-1}}\right)^2 -2\right)a_n$ for every positive integer $n$. Prove that $\displaystyle \sum_{i=0}^k \frac{1}{a_i} < \frac{2+a-\sqrt{a^2-4}}{2}$ for every positive integer $k$.
Find all functions $f:\mathbb{R}^{+}\rightarrow \mathbb{R}^{+}$ such that
$x,y\in \mathbb{R}^{+},$ \[ f\left(\frac{y}{f(x+1)}\right)+f\left(\frac{x+1}{xf(y)}\right)=f(y) \]
For $n\ge 1$ let $d_n$ be the $\gcd$ of the entries of $A^n-\mathcal{I}_2$ where
\[ A=\begin{pmatrix} 3&2\\ 4&3\end{pmatrix}\quad \text{ and }\quad \mathcal{I}_2=\begin{pmatrix}1&0\\ 0&1\\\end{pmatrix}\]
Show that $\lim_{n\to \infty}d_n=\infty$.
In the plane, there are $n \geqslant 6$ pairwise disjoint disks $D_{1}, D_{2}, \ldots, D_{n}$ with radii $R_{1} \geqslant R_{2} \geqslant \ldots \geqslant R_{n}$. For every $i=1,2, \ldots, n$, a point $P_{i}$ is chosen in disk $D_{i}$. Let $O$ be an arbitrary point in the plane. Prove that \[O P_{1}+O P_{2}+\ldots+O P_{n} \geqslant R_{6}+R_{7}+\ldots+R_{n}.\]
(A disk is assumed to contain its boundary.)
$a_1, a_2, ..., a_{95}$ are positive reals. Show that
$\displaystyle \sum_{k=1}^{95}{a_k} \le 94+ \prod_{k=1}^{95}{\max{\{1,a_k\}}}$