Found problems: 800
On a line are given $2k -1$ white segments and $2k -1$ black ones. Assume that each white segment intersects at least $k$ black segments, and each black segment intersects at least $k$ white ones. Prove that there are a black segment intersecting all the white ones, and a white segment intersecting all the black ones.
Determine all functions $f$ defined on the set of all positive integers and taking non-negative integer values, satisfying the three conditions:
[list]
[*] $(i)$ $f(n) \neq 0$ for at least one $n$;
[*] $(ii)$ $f(x y)=f(x)+f(y)$ for every positive integers $x$ and $y$;
[*] $(iii)$ there are infinitely many positive integers $n$ such that $f(k)=f(n-k)$ for all $k<n$.
[/list]
Let $ a_1$, $ a_2$, $ \ldots$, $ a_n$ be distinct positive integers, $ n\ge 3$. Prove that there exist distinct indices $ i$ and $ j$ such that $ a_i \plus{} a_j$ does not divide any of the numbers $ 3a_1$, $ 3a_2$, $ \ldots$, $ 3a_n$.
[i]Proposed by Mohsen Jamaali, Iran[/i]
Let $a$ and $b$ be distinct positive integers. The following infinite process takes place on an initially empty board.
[list=i]
[*] If there is at least a pair of equal numbers on the board, we choose such a pair and increase one of its components by $a$ and the other by $b$.
[*] If no such pair exists, we write two times the number $0$.
[/list]
Prove that, no matter how we make the choices in $(i)$, operation $(ii)$ will be performed only finitely many times.
Proposed by [I]Serbia[/I].
Let $f$ and $g$ be two nonzero polynomials with integer coefficients and $\deg f>\deg g$. Suppose that for infinitely many primes $p$ the polynomial $pf+g$ has a rational root. Prove that $f$ has a rational root.
Let $S$ be an infinite set of positive integers, such that there exist four pairwise distinct $a,b,c,d \in S$ with $\gcd(a,b) \neq \gcd(c,d)$. Prove that there exist three pairwise distinct $x,y,z \in S$ such that $\gcd(x,y)=\gcd(y,z) \neq \gcd(z,x)$.
Let $M$ be a subset of the set of $2021$ integers $\{1, 2, 3, ..., 2021\}$ such that for any three elements (not necessarily distinct) $a, b, c$ of $M$ we have $|a + b - c | > 10$.
Determine the largest possible number of elements of $M$.
Let $a$ and $b$ be distinct positive integers. The following infinite process takes place on an initially empty board.
[list=i]
[*] If there is at least a pair of equal numbers on the board, we choose such a pair and increase one of its components by $a$ and the other by $b$.
[*] If no such pair exists, we write two times the number $0$.
[/list]
Prove that, no matter how we make the choices in $(i)$, operation $(ii)$ will be performed only finitely many times.
Proposed by [I]Serbia[/I].
Find the smallest positive constant $c$ satisfying: For any simple graph $G=G(V,E)$, if $|E|\geq c|V|$, then $G$ contains $2$ cycles with no common vertex, and one of them contains a chord.
Note: The cycle of graph $G(V,E)$ is a set of distinct vertices ${v_1,v_2...,v_n}\subseteq V$, $v_iv_{i+1}\in E$ for all $1\leq i\leq n$ $(n\geq 3, v_{n+1}=v_1)$; a cycle containing a chord is the cycle ${v_1,v_2...,v_n}$, such that there exist $i,j, 1< i-j< n-1$, satisfying $v_iv_j\in E$.
Two squirrels, Bushy and Jumpy, have collected 2021 walnuts for the winter. Jumpy numbers the walnuts from 1 through 2021, and digs 2021 little holes in a circular pattern in the ground around their favourite tree. The next morning Jumpy notices that Bushy had placed one walnut into each hole, but had paid no attention to the numbering. Unhappy, Jumpy decides to reorder the walnuts by performing a sequence of 2021 moves. In the $k$-th move, Jumpy swaps the positions of the two walnuts adjacent to walnut $k$.
Prove that there exists a value of $k$ such that, on the $k$-th move, Jumpy swaps some walnuts $a$ and $b$ such that $a<k<b$.
There are $n \ge 3$ distinct positive real numbers. Show that there are at most $n-2$ different integer power of three that can be written as the sum of three distinct elements from these $n$ numbers.
Let $m \neq 0 $ be an integer. Find all polynomials $P(x) $ with real coefficients such that
\[ (x^3 - mx^2 +1 ) P(x+1) + (x^3+mx^2+1) P(x-1) =2(x^3 - mx +1 ) P(x) \]
for all real number $x$.
Prove that $\sqrt 3$ is irrational.
Determine whether there exists an infinite sequence of nonzero digits $a_1 , a_2 , a_3 , \cdots $ and a positive integer $N$ such that for every integer $k > N$, the number $\overline{a_k a_{k-1}\cdots a_1 }$ is a perfect square.
Suppose that $f : \mathbb{N} \rightarrow \mathbb{N}$ is a function for which the expression $af(a)+bf(b)+2ab$ for all $a,b \in \mathbb{N}$ is always a perfect square. Prove that $f(a)=a$ for all $a \in \mathbb{N}$.
Given a prime $p$, prove that the sum $\sum_{k=1}^{\lfloor \frac{q}{p} \rfloor}{k^{p-1}}$ is not divisible by $q$ for all but finitely many primes $q$.
2/1/31. Let $x, y,$ and $z$ be real numbers greater than $1$. Prove that if $x^y = y^z = z^x$, then $x = y = z$.
Find all positive integers $n$ with the following property: the $k$ positive divisors of $n$ have a permutation $(d_1,d_2,\ldots,d_k)$ such that for $i=1,2,\ldots,k$, the number $d_1+d_2+\cdots+d_i$ is a perfect square.
Find all positive integers $n$ with the following property: the $k$ positive divisors of $n$ have a permutation $(d_1,d_2,\ldots,d_k)$ such that for $i=1,2,\ldots,k$, the number $d_1+d_2+\cdots+d_i$ is a perfect square.
Positive integers $x_1, x_2, \dots, x_n$ ($n \ge 4$) are arranged in a circle such that each $x_i$ divides the sum of the neighbors; that is \[ \frac{x_{i-1}+x_{i+1}}{x_i} = k_i \] is an integer for each $i$, where $x_0 = x_n$, $x_{n+1} = x_1$. Prove that \[ 2n \le k_1 + k_2 + \dots + k_n < 3n. \]
Let $S$ be a nonempty set of positive integers. We say that a positive integer $n$ is [i]clean[/i] if it has a unique representation as a sum of an odd number of distinct elements from $S$. Prove that there exist infinitely many positive integers that are not clean.
Determine all integers $ n\geq 2$ having the following property: for any integers $a_1,a_2,\ldots, a_n$ whose sum is not divisible by $n$, there exists an index $1 \leq i \leq n$ such that none of the numbers $$a_i,a_i+a_{i+1},\ldots,a_i+a_{i+1}+\ldots+a_{i+n-1}$$ is divisible by $n$. Here, we let $a_i=a_{i-n}$ when $i >n$.
[i]Proposed by Warut Suksompong, Thailand[/i]
Find all positive integers $(a,b,c)$ such that
$$ab-c,\quad bc-a,\quad ca-b$$ are all powers of $2$.
[i]Proposed by Serbia[/i]
What is the number of ways the numbers from $1$ to $14$ can be split into $7$ pairs such that for each pair, the greater number is at least $2$ times the smaller number?
$\textbf{(A) }108\qquad\textbf{(B) }120\qquad\textbf{(C) }126\qquad\textbf{(D) }132\qquad\textbf{(E) }144$
In an exhibition there are $100$ paintings each of which is made with exactly $k$ colors. Find the minimum possible value of $k$ if any $20$ paintings have a common color but there is no color that is used in all paintings.