Found problems: 800
Let $p$ be a prime, $A$ is an infinite set of integers. Prove that there is a subset $B$ of $A$ with $2p-2$ elements, such that the arithmetic mean of any pairwise distinct $p$ elements in $B$ does not belong to $A$.
We say that a square-free positive integer $n$ is [i]almost prime[/i] if
\[n \mid x^{d_1}+x^{d_2}+\dots+x^{d_k}-kx\]
for all integers $x$, where $1=d_1<d_2<\dots<d_k=n$ are all the positive divisors of $n$. Suppose that $r$ is a Fermat prime (i.e. it is a prime of the form $2^{2^m}+1$ for an integer $m \ge 0$), $p$ is a prime divisor of an almost prime integer $n$, and $p \equiv 1 \pmod{r}$. Show that, with the above notation, $d_i \equiv 1 \pmod{r}$ for all $1 \le i \le k$.
(An integer $n$ is called [i]square-free[/i] if it is not divisible by $d^2$ for any integer $d>1$.)
Let $ n$ be a positive integer and let $ a_1,a_2,a_3,\ldots,a_k$ $ ( k\ge 2)$ be distinct integers in the set $ { 1,2,\ldots,n}$ such that $ n$ divides $ a_i(a_{i + 1} - 1)$ for $ i = 1,2,\ldots,k - 1$. Prove that $ n$ does not divide $ a_k(a_1 - 1).$
[i]Proposed by Ross Atkins, Australia [/i]
Find all functions $f : R\to R$ satisfying $xf(x + xy) = xf(x) + f(x^2)f(y)$ for all $x, y \in R$.
A rectangle $ D$ is partitioned in several ($ \ge2$) rectangles with sides parallel to those of $ D$. Given that any line parallel to one of the sides of $ D$, and having common points with the interior of $ D$, also has common interior points with the interior of at least one rectangle of the partition; prove that there is at least one rectangle of the partition having no common points with $ D$'s boundary.
[i]Author: Kei Irie, Japan[/i]
Find all functions $f: \mathbb R \to \mathbb R$ such that for any $x,y \in \mathbb R$, the multiset $\{(f(xf(y)+1),f(yf(x)-1)\}$ is identical to the multiset $\{xf(f(y))+1,yf(f(x))-1\}$.
[i]Note:[/i] The multiset $\{a,b\}$ is identical to the multiset $\{c,d\}$ if and only if $a=c,b=d$ or $a=d,b=c$.
We say that a set $S$ of integers is [i]rootiful[/i] if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $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]
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]
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]
Let $\mathbb{R}^+$ be the set of positive real numbers. Find all functions $f \colon \mathbb{R}^+ \to \mathbb{R}^+$ such that, for all $x,y \in \mathbb{R}^+$,
$$f(xy+f(x))=xf(y)+2.$$
For a positive integer $M$, if there exist integers $a$, $b$, $c$ and $d$ so that:
\[ M \leq a < b \leq c < d \leq M+49, \qquad ad=bc \]
then we call $M$ a GOOD number, if not then $M$ is BAD. Please find the greatest GOOD number and the smallest BAD number.
A positive integer $N$ is called [i]googolicious[/i] if there are exactly $10^{100}$ positive integers $x$ that satisfy \[\left\lfloor \frac{N}{\left\lfloor \frac{N}{x} \right\rfloor } \right\rfloor = x,\] where $z$ denotes the greatest integer less than $z.$ Find, with proof, all googolicious integers $N.$
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]
Let $\, k_1 < k_2 < k_3 < \cdots \,$ be positive integers, no two consecutive, and let $\, s_m = k_1 + k_2 + \cdots + k_m \,$ for $\, m = 1,2,3, \ldots \; \;$. Prove that, for each positive integer $\, n, \,$ the interval $\, [s_n, s_{n+1}) \,$ contains at least one perfect square.
Each two-digit is number is coloured in one of $k$ colours. What is the minimum value of $k$ such that, regardless of the colouring, there are three numbers $a$, $b$ and $c$ with different colours with $a$ and $b$ having the same units digit (second digit) and $b$ and $c$ having the same tens digit (first digit)?
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\}$.
Do there exist $10$ real numbers, not all of which are equal, each of which is equal to the square of the sum of the remaining $9$ numbers?
[i]Proposed by Bogdan Rublov[/i]
Find all pairs of positive integers $(x, y)$ such that $(xy+1)(xy+x+2)$ be a perfect square .
Let $ABC$ be a triangle with $\angle ABC$ obtuse. The [i]$A$-excircle[/i] is a circle in the exterior of $\triangle ABC$ that is tangent to side $BC$ of the triangle and tangent to the extensions of the other two sides. Let $E$, $F$ be the feet of the altitudes from $B$ and $C$ to lines $AC$ and $AB$, respectively. Can line $EF$ be tangent to the $A$-excircle?
[i]Proposed by Ankan Bhattacharya, Zack Chroman, and Anant Mudgal[/i]
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$.)
A hunter and an invisible rabbit play a game on an infinite square grid. First the hunter fixes a colouring of the cells with finitely many colours. The rabbit then secretly chooses a cell to start in. Every minute, the rabbit reports the colour of its current cell to the hunter, and then secretly moves to an adjacent cell that it has not visited before (two cells are adjacent if they share an edge). The hunter wins if after some finite time either:[list][*]the rabbit cannot move; or
[*]the hunter can determine the cell in which the rabbit started.[/list]Decide whether there exists a winning strategy for the hunter.
[i]Proposed by Aron Thomas[/i]
Minivan and Megavan play a game. For a positive integer $n$, Minivan selects a sequence of integers $a_1,a_2,\ldots,a_n$. An operation on $a_1,a_2,\ldots,a_n$ means selecting an $a_i$ and increasing it by $1$. Minivan and Megavan take turns, with Minivan going first. On Minivan's turn, he performs at most $2025$ operations, and he may choose the same integer repeatedly. On Megavan's turn, he performs exactly $1$ operation instead. Megavan wins if at any point in the game, including in the middle of Minivan's operations, two numbers in the sequence are equal.
[i](Proposed by Ho Janson)[/i]
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.
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.