Found problems: 5802
The function $f: \mathbb{N}\to\mathbb{N}_{0}$ satisfies for all $m,n\in\mathbb{N}$: \[f(m+n)-f(m)-f(n)=0\text{ or }1, \; f(2)=0, \; f(3)>0, \; \text{ and }f(9999)=3333.\] Determine $f(1982)$.
If a $5 \times n$ rectangle can be tiled using $n$ pieces like those shown in the diagram, prove that $n$ is even. Show that there are more than $2 \cdot 3^{k-1}$ ways to file a fixed $5 \times 2k$ rectangle $(k \geq 3)$ with $2k$ pieces. (symmetric constructions are supposed to be different.)
A polynomial $p$ with real coefficients satisfies $p(x+1)-p(x)=x^{100}$ for all $x \in \mathbb{R}.$ Prove that $p(1-t) \ge p(t)$ for $0 \le t \le 1/2.$
Let $f(n)$ be the number of ways to write $n$ as a sum of powers of $2$, where we keep track of the order of the summation. For example, $f(4)=6$ because $4$ can be written as $4$, $2+2$, $2+1+1$, $1+2+1$, $1+1+2$, and $1+1+1+1$. Find the smallest $n$ greater than $2013$ for which $f(n)$ is odd.
Two distinct positive integers are called "relatively consistent" if the larger one can be written as a sum of some distinct positive divisors of the other one. Show that there exist 2018 positive integers such that any two of them are "relatively consistent"
The plane is divided into regions by $ n \ge 3$ lines, no two of which are parallel, and no three of which are concurrent. Some regions are coloured , in such a way that no two coloured regions share a common segment or half-line of their borders. Prove that the number of coloured regions is at most $ \frac{n(n\plus{}1)}{3}$
A token is placed at each vertex of a regular $2n$-gon. A [i]move[/i] consists in choosing an edge of the $2n$-gon and swapping the two tokens placed at the endpoints of that edge. After a finite number of moves have been performed, it turns out that every two tokens have been swapped exactly once. Prove that some edge has never been chosen.
For positive integers $n$ and $k \geq 2$, define $E_k(n)$ as the greatest exponent $r$ such that $k^r$ divides $n!$. Prove that there are infinitely many $n$ such that $E_{10}(n) > E_9(n)$ and infinitely many $m$ such that $E_{10}(m) < E_9(m)$.
Show that $n!=a^{n-1}+b^{n-1}+c^{n-1}$ has only finitely many solutions in positive integers.
[i]Proposed by Dorlir Ahmeti, Albania[/i]
Find, as a function of $\, n, \,$ the sum of the digits of
\[ 9 \times 99 \times 9999 \times \cdots \times \left( 10^{2^n} - 1 \right), \]
where each factor has twice as many digits as the previous one.
Let $(x_n)_{n\in \mathbb{N}}$ be a sequence defined recursively such that $x_1=\sqrt{2}$ and
$$x_{n+1}=x_n+\frac{1}{x_n}\text{ for }n\in \mathbb{N}.$$
Prove that the following inequality holds:
$$\frac{x_1^2}{2x_1x_2-1}+\frac{x_2^2}{2x_2x_3-1}+\dotsc +\frac{x_{2018}^2}{2x_{2018}x_{2019}-1}+\frac{x_{2019}^2}{2x_{2019}x_{2020}-1}>\frac{2019^2}{x_{2019}^2+\frac{1}{x_{2019}^2}}.$$
[i]Proposed by Ivan Novak[/i]
Find the largest positive integer with the property that each digit apart from the first and the last one is smaller than the arithmetic mean of her neighbours.
Let $ u,v $ be two endomorphisms of a finite vectorial space that verify the relation $ uv-vu=u. $
Calculate $ u^kv-vu^k $ and show that u is nilpotent.
Let $ a_{0},a_{1},\ldots,a_{n}$ be integers, one of which is nonzero, and all of the numbers are not less than $ \minus{} 1$. Prove that if \[ a_{0} \plus{} 2a_{1} \plus{} 2^{2}a_{2} \plus{} \cdots \plus{} 2^{n}a_{n} \equal{} 0,\] then $ a_{0} \plus{} a_{1} \plus{} \cdots \plus{} a_{n} > 0$.
The vertices of a connected graph cannot be coloured with less than $n+1$ colours (so that adjacent vertices have different colours).
Prove that $\dfrac{n(n-1)}{2}$ edges can be removed from the graph so that it remains connected.
[i]V. Dolnikov[/i]
[b]EDIT.[/b] It is confirmed by the official solution that the graph is tacitly assumed to be [b]finite[/b].
Let $n \geq 3$ be a positive integer. Find the maximum number of diagonals in a regular $n$-gon one can select, so that any two of them do not intersect in the interior or they are perpendicular to each other.
Let $ G$ be a finite group. For arbitrary sets $ U, V, W \subset G$, denote by $ N_{UVW}$ the number of triples $ (x, y, z) \in U \times V \times W$ for which $ xyz$ is the unity .
Suppose that $ G$ is partitioned into three sets $ A, B$ and $ C$ (i.e. sets $ A, B, C$ are pairwise disjoint and $ G = A \cup B \cup C$). Prove that $ N_{ABC}= N_{CBA}.$
Given a positive integer $n \ge 2$. Find all $n$-tuples of positive integers $(a_1,a_2,\ldots,a_n)$, such that $1<a_1 \le a_2 \le a_3 \le \cdots \le a_n$, $a_1$ is odd, and
(1) $M=\frac{1}{2^n}(a_1-1)a_2 a_3 \cdots a_n$ is a positive integer;
(2) One can pick $n$-tuples of integers $(k_{i,1},k_{i,2},\ldots,k_{i,n})$ for $i=1,2,\ldots,M$ such that for any $1 \le i_1 <i_2 \le M$, there exists $j \in \{1,2,\ldots,n\}$ such that $k_{i_1,j}-k_{i_2,j} \not\equiv 0, \pm 1 \pmod{a_j}$.
Let $(a_n)_{n=0}^{\infty}$ be a sequence of real numbers such that $a_0=0$ and
$$a_{n+1}^3=a_n^2-8\quad \text{for} \quad n=0,1,2,…$$
Prove that the following series is convergent:
$$\sum_{n=0}^{\infty}{|a_{n+1}-a_n|}.$$
[i]Proposed by Orif Ibrogimov, National University of Uzbekistan[/i]
The degrees of polynomials $P$ and $Q$ with real coefficients do not exceed $n$. These polynomials satisfy the identity
\[ P(x) x^{n + 1} + Q(x) (x+1)^{n + 1} = 1. \]
Determine all possible values of $Q \left( - \frac{1}{2} \right)$.
Joe and Penny play a game. Initially there are $5000$ stones in a pile, and the two players remove stones from the pile by making a sequence of moves. On the $k$-th move, any number of stones between $1$ and $k$ inclusive may be removed. Joe makes the odd-numbered moves and Penny makes the even-numbered moves. The player who removes the very last stone is the winner. Who wins if both players play perfectly?
Find all real-valued functions $f$ on the reals such that $f(-x) = -f(x)$, $f(x+1) = f(x) + 1$ for all $x$, and $f\left(\dfrac{1}{x}\right) = \dfrac{f(x)}{x^2}$ for $x \not = 0$.
Find all function $f:\mathbb{R}\to \mathbb{R}$ such that
\[f(x)f(y)=f(xy-1)+yf(x)+xf(y)\]
for all $x,y \in \mathbb{R}$
Let $a_1,a_2,a_3,\ldots$ be a sequence of integers, with the property that every consecutive group of $a_i$'s averages to a perfect square. More precisely, for every positive integers $n$ and $k$, the quantity \[\frac{a_n+a_{n+1}+\cdots+a_{n+k-1}}{k}\] is always the square of an integer. Prove that the sequence must be constant (all $a_i$ are equal to the same perfect square).
[i]Evan O'Dorney and Victor Wang[/i]
Let $r$ and $b$ be positive integers. The game of [i]Monis[/i], a variant of Tetris, consists of a single column of red and blue blocks. If two blocks of the same color ever touch each other, they both vanish immediately. A red block falls onto the top of the column exactly once every $r$ years, while a blue block falls exactly once every $b$ years.
(a) Suppose that $r$ and $b$ are odd, and moreover the cycles are offset in such a way that no two blocks ever fall at exactly the same time. Consider a period of $rb$ years in which the column is initially empty. Determine, in terms of $r$ and $b$, the number of blocks in the column at the end.
(b) Now suppose $r$ and $b$ are relatively prime and $r+b$ is odd. At time $t=0$, the column is initially empty. Suppose a red block falls at times $t = r, 2r, \dots, (b-1)r$ years, while a blue block falls at times $t = b, 2b, \dots, (r-1)b$ years. Prove that at time $t=rb$, the number of blocks in the column is $\left\lvert 1+2(r-1)(b+r)-8S \right\rvert$, where \[ S = \left\lfloor \frac{2r}{r+b} \right\rfloor
+ \left\lfloor \frac{4r}{r+b} \right\rfloor
+ ...
+ \left\lfloor \frac{(r+b-1)r}{r+b} \right\rfloor
. \]
[i]Proposed by Sammy Luo[/i]