Found problems: 800
In a regular 100-gon, 41 vertices are colored black and the remaining 59 vertices are colored white. Prove that there exist 24 convex quadrilaterals $Q_{1}, \ldots, Q_{24}$ whose corners are vertices of the 100-gon, so that
[list]
[*] the quadrilaterals $Q_{1}, \ldots, Q_{24}$ are pairwise disjoint, and
[*] every quadrilateral $Q_{i}$ has three corners of one color and one corner of the other color.
[/list]
Let $a$ be positive real number such that $a^{3}=6(a+1)$. Prove that the equation $x^{2}+ax+a^{2}-6=0$ has no real solution.
Find all functions $f: (0, \infty) \to (0, \infty)$ such that
\begin{align*}
f(y(f(x))^3 + x) = x^3f(y) + f(x)
\end{align*}
for all $x, y>0$.
[i]Proposed by Jason Prodromidis, Greece[/i]
For $ n\geq2$ let $ a_1, a_2, \ldots a_n$ be positive real numbers such that
\[ (a_1 \plus{} a_2 \plus{} \cdots \plus{} a_n)\left(\frac {1}{a_1} \plus{} \frac {1}{a_2} \plus{} \cdots \plus{} \frac {1}{a_n}\right) \leq \left(n \plus{} \frac {1}{2}\right)^2.
\]
Prove that $ \max(a_1, a_2, \ldots, a_n)\leq 4\min(a_1, a_2, \ldots, a_n)$.
Let $\mathbb R_{>0}$ be the set of positive real numbers. Determine all functions $f \colon \mathbb R_{>0} \to \mathbb R_{>0}$ such that \[x \big(f(x) + f(y)\big) \geqslant \big(f(f(x)) + y\big) f(y)\] for every $x, y \in \mathbb R_{>0}$.
Prove that the Polynomial $ f(x) \equal{} x^{4} \plus{} 26x^{3} \plus{} 56x^{2} \plus{} 78x \plus{} 1989$ can't be expressed as a product $ f(x) \equal{} p(x)q(x)$ , where $ p(x)$ and $ q(x)$ are both polynomial with integral coefficients and with degree at least $ 1$.
Let $\alpha \geq 1$ be a real number. Hephaestus and Poseidon play a turn-based game on an infinite grid of unit squares. Before the game starts, Poseidon chooses a finite number of cells to be [i]flooded[/i]. Hephaestus is building a [i]levee[/i], which is a subset of unit edges of the grid (called [i]walls[/i]) forming a connected, non-self-intersecting path or loop*.
The game then begins with Hephaestus moving first. On each of Hephaestus’s turns, he adds one or more walls to the levee, as long as the total length of the levee is at most $\alpha n$ after his $n$th turn. On each of Poseidon’s turns, every cell which is adjacent to an already flooded cell and with no wall between them becomes flooded as well. Hephaestus wins if the levee forms a closed loop such that all flooded cells are contained in the interior of the loop — hence stopping the flood and saving the world. For which $\alpha$ can Hephaestus guarantee victory in a finite number of turns no matter how Poseidon chooses the initial cells to flood?
-----
[size=75]*More formally, there must exist lattice points $\mbox{\footnotesize \(A_0, A_1, \dotsc, A_k\)}$, pairwise distinct except possibly $\mbox{\footnotesize \(A_0 = A_k\)}$, such that the set of walls is exactly $\mbox{\footnotesize \(\{A_0A_1, A_1A_2, \dotsc , A_{k-1}A_k\}\)}$. Once a wall is built it cannot be destroyed; in particular, if the levee is a closed loop (i.e. $\mbox{\footnotesize \(A_0 = A_k\)}$) then Hephaestus cannot add more walls. Since each wall has length $\mbox{\footnotesize \(1\)}$, the length of the levee is $\mbox{\footnotesize \(k\)}$.[/size]
[i]Nikolai Beluhov[/i]
For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.
We are given an infinite deck of cards, each with a real number on it. For every real number $x$, there is exactly one card in the deck that has $x$ written on it. Now two players draw disjoint sets $A$ and $B$ of $100$ cards each from this deck. We would like to define a rule that declares one of them a winner. This rule should satisfy the following conditions:
1. The winner only depends on the relative order of the $200$ cards: if the cards are laid down in increasing order face down and we are told which card belongs to which player, but not what numbers are written on them, we can still decide the winner.
2. If we write the elements of both sets in increasing order as $A =\{ a_1 , a_2 , \ldots, a_{100} \}$ and $B= \{ b_1 , b_2 , \ldots , b_{100} \}$, and $a_i > b_i$ for all $i$, then $A$ beats $B$.
3. If three players draw three disjoint sets $A, B, C$ from the deck, $A$ beats $B$ and $B$ beats $C$ then $A$ also beats $C$.
How many ways are there to define such a rule? Here, we consider two rules as different if there exist two sets $A$ and $B$ such that $A$ beats $B$ according to one rule, but $B$ beats $A$ according to the other.
[i]Proposed by Ilya Bogdanov, Russia[/i]
Suppose that $f$ and $g$ are two functions defined on the set of positive integers and taking positive integer values. Suppose also that the equations $f(g(n)) = f(n) + 1$ and $g(f(n)) = g(n) + 1$ hold for all positive integers. Prove that $f(n) = g(n)$ for all positive integer $n.$
[i]Proposed by Alex Schreiber, Germany[/i]
Let $p$ be an odd prime and $r$ an odd natural number.Show that $pr+1$ does not divide $p^p-1$
For any odd prime $p$ and any integer $n,$ let $d_p (n) \in \{ 0,1, \dots, p-1 \}$ denote the remainder when $n$ is divided by $p.$ We say that $(a_0, a_1, a_2, \dots)$ is a [i]p-sequence[/i], if $a_0$ is a positive integer coprime to $p,$ and $a_{n+1} =a_n + d_p (a_n)$ for $n \geqslant 0.$
(a) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_n >b_n$ for infinitely many $n,$ and $b_n > a_n$ for infinitely many $n?$
(b) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_0 <b_0,$ but $a_n >b_n$ for all $n \geqslant 1?$
[I]United Kingdom[/i]
Does there exist a finite set $A$ of positive integers of at least two elements and an infinite set $B$ of positive integers, such that any two distinct elements in $A+B$ are coprime, and for any coprime positive integers $m,n$, there exists an element $x$ in $A+B$ satisfying $x\equiv n \pmod m$ ?
Here $A+B=\{a+b|a\in A, b\in B\}$.
Determine all integers $n\geqslant 2$ with the following property: every $n$ pairwise distinct integers whose sum is not divisible by $n$ can be arranged in some order $a_1,a_2,\ldots, a_n$ so that $n$ divides $1\cdot a_1+2\cdot a_2+\cdots+n\cdot a_n.$
[i]Arsenii Nikolaiev, Anton Trygub, Oleksii Masalitin, and Fedir Yudin[/i]
There are $ n ( \ge 4 ) $ people and some people shaked hands each other. Two people can shake hands at most 1 time. For arbitrary four people $ A, B, C, D$ such that $ (A,B), (B,C), (C,D) $ shaked hands, then one of $ (A,C), (A,D), (B,D) $ shaked hand each other. Prove the following statements.
(a) Prove that $ n $ people can be divided into two groups, $ X, Y ( \ne \emptyset )$ , such that for all $ (x,y) $ where $ x \in X $ and $ y \in Y $, $ x $ and $ y $ shaked hands or $ x $ and $ y $ didn't shake hands.
(b) There exist two people $ A , B $ such that the set of people who are not $ A $ and $ B $ that shaked hands with $ A $ is same wiith the set of people who are not $ A $ and $ B $ that shaked hands with $ B $.
For each integer $k\geq 2$, determine all infinite sequences of positive integers $a_1$, $a_2$, $\ldots$ for which there exists a polynomial $P$ of the form \[ P(x)=x^k+c_{k-1}x^{k-1}+\dots + c_1 x+c_0, \] where $c_0$, $c_1$, \dots, $c_{k-1}$ are non-negative integers, such that \[ P(a_n)=a_{n+1}a_{n+2}\cdots a_{n+k} \] for every integer $n\geq 1$.
Determine all integers $n\geqslant 2$ with the following property: every $n$ pairwise distinct integers whose sum is not divisible by $n$ can be arranged in some order $a_1,a_2,\ldots, a_n$ so that $n$ divides $1\cdot a_1+2\cdot a_2+\cdots+n\cdot a_n.$
[i]Arsenii Nikolaiev, Anton Trygub, Oleksii Masalitin, and Fedir Yudin[/i]
suppose that $A$ is the set of all Closed intervals $[a,b] \subset \mathbb{R}$. Find all functions $f:\mathbb{R} \rightarrow A$ such that
$\bullet$ $x \in f(y) \Leftrightarrow y \in f(x)$
$\bullet$ $|x-y|>2 \Leftrightarrow f(x) \cap f(y)=\varnothing$
$\bullet$ For all real numbers $0\leq r\leq 1$, $f(r)=[r^2-1,r^2+1]$
Proposed by Matin Yousefi
A number is called [i]Norwegian[/i] if it has three distinct positive divisors whose sum is equal to $2022$. Determine the smallest Norwegian number.
(Note: The total number of positive divisors of a Norwegian number is allowed to be larger than $3$.)
Alice and Bob play the following game. They alternate selecting distinct nonzero digits (from $1$ to $9$) until they have chosen seven such digits, and then consider the resulting seven-digit number by concatenating the digits in the order selected, with the seventh digit appearing last (i.e. $\overline{A_1B_2A_3B_4A_6B_6A_7}$). Alice wins if and only if the resulting number is the last seven decimal digits of some perfect seventh power. Please determine which player has the winning strategy.
Find all $C\in \mathbb{R}$ such that every sequence of integers $\{a_n\}_{n=1}^{\infty}$ which is bounded from below and for all $n\geq 2$ satisfy $$0\leq a_{n-1}+Ca_n+a_{n+1}<1$$ is periodic.
Proposed by Navid Safaei
Prove that $\sqrt[3]{5}$ is irrational.
Consider any rectangular table having finitely many rows and columns, with a real number $a(r, c)$ in the cell in row $r$ and column $c$. A pair $(R, C)$, where $R$ is a set of rows and $C$ a set of columns, is called a [i]saddle pair[/i] if the following two conditions are satisfied:
[list]
[*] $(i)$ For each row $r^{\prime}$, there is $r \in R$ such that $a(r, c) \geqslant a\left(r^{\prime}, c\right)$ for all $c \in C$;
[*] $(ii)$ For each column $c^{\prime}$, there is $c \in C$ such that $a(r, c) \leqslant a\left(r, c^{\prime}\right)$ for all $r \in R$.
[/list]
A saddle pair $(R, C)$ is called a [i]minimal pair[/i] if for each saddle pair $\left(R^{\prime}, C^{\prime}\right)$ with $R^{\prime} \subseteq R$ and $C^{\prime} \subseteq C$, we have $R^{\prime}=R$ and $C^{\prime}=C$. Prove that any two minimal pairs contain the same number of rows.
For a positive integer $n$, let $d(n)$ be the number of positive divisors of $n$, and let $\varphi(n)$ be the number of positive integers not exceeding $n$ which are coprime to $n$. Does there exist a constant $C$ such that
$$ \frac {\varphi ( d(n))}{d(\varphi(n))}\le C$$
for all $n\ge 1$
[i]Cyprus[/i]
A directed graph (any two distinct vertices joined by at most one directed line) has the following property: If $x, u,$ and $v$ are three distinct vertices such that $x \to u$ and $x \to v$, then $u \to w$ and $v \to w$ for some vertex $w$. Suppose that $x \to u \to y \to\cdots \to z$ is a path of length $n$, that cannot be extended to the right (no arrow goes away from $z$). Prove that every path beginning at $x$ arrives after $n$ steps at $z.$