Found problems: 800
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]
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]
Let $n>1$ be a positive integer. Each cell of an $n\times n$ table contains an integer. Suppose that the following conditions are satisfied:
[list=1]
[*] Each number in the table is congruent to $1$ modulo $n$.
[*] The sum of numbers in any row, as well as the sum of numbers in any column, is congruent to $n$ modulo $n^2$.
[/list]
Let $R_i$ be the product of the numbers in the $i^{\text{th}}$ row, and $C_j$ be the product of the number in the $j^{\text{th}}$ column. Prove that the sums $R_1+\hdots R_n$ and $C_1+\hdots C_n$ are congruent modulo $n^4$.
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$.)
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.
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.
Prove that $5^n-3^n$ is not divisible by $2^n+65$ for any positive integer $n$.
Let $k$ and $n$ be positive integers with $n\geq k^2-3k+4$, and let
$$f(z)=z^{n-1}+c_{n-2}z^{n-2}+\dots+c_0$$
be a polynomial with complex coefficients such that
$$c_0c_{n-2}=c_1c_{n-3}=\dots=c_{n-2}c_0=0$$
Prove that $f(z)$ and $z^n-1$ have at most $n-k$ common roots.
Let $(a_n)_{n\geq 1}$ be a sequence of positive real numbers with the property that
$$(a_{n+1})^2 + a_na_{n+2} \leq a_n + a_{n+2}$$
for all positive integers $n$. Show that $a_{2022}\leq 1$.
Find all function $f:\mathbb{R}\rightarrow\mathbb{R}$ such that for all $x,y\in\mathbb{R}$ the following equality holds \[
f(\left\lfloor x\right\rfloor y)=f(x)\left\lfloor f(y)\right\rfloor \] where $\left\lfloor a\right\rfloor $ is greatest integer not greater than $a.$
[i]Proposed by Pierre Bornsztein, France[/i]
Prove that $5^n-3^n$ is not divisible by $2^n+65$ for any positive integer $n$.
Let $n$ be an integer greater than $1$ and let $X$ be an $n$-element set. A non-empty collection of subsets $A_1, ..., A_k$ of $X$ is tight if the union $A_1 \cup \cdots \cup A_k$ is a proper subset of $X$ and no element of $X$ lies in exactly one of the $A_i$s. Find the largest cardinality of a collection of proper non-empty subsets of $X$, no non-empty subcollection of which is tight.
[i]Note[/i]. A subset $A$ of $X$ is proper if $A\neq X$. The sets in a collection are assumed to be distinct. The whole collection is assumed to be a subcollection.
The lateral surface of a cylinder of revolution is divided by $n-1$ planes parallel to the base and $m$ parallel generators into $mn$ cases $( n\ge 1,m\ge 3)$. Two cases will be called neighbouring cases if they have a common side. Prove that it is possible to write a real number in each case such that each number is equal to the sum of the numbers of the neighbouring cases and not all the numbers are zero if and only if there exist integers $k,l$ such that $n+1$ does not divide $k$ and
\[ \cos \frac{2l\pi}{m}+\cos\frac{k\pi}{n+1}=\frac{1}{2}\]
[i]Ciprian Manolescu[/i]
Let $a,m$ be positive integers such that $Ord_m (a)$ is odd and for any integers $x,y$ so that
1.$xy \equiv a \pmod m$
2.$Ord_m(x) \le Ord_m(a)$
3.$Ord_m(y) \le Ord_m(a)$
We have either $Ord_m(x)|Ord_m(a)$ or $Ord_m(y)|Ord_m(a)$.prove that $Ord_m(a)$ contains at most one prime factor.
Let $\mathbb{R}_{>0}$ be the set of the positive real numbers. Find all functions $f:\mathbb{R}_{>0} \rightarrow \mathbb{R}_{>0}$ such that $$f(xy+f(x))=f(f(x)f(y))+x$$ for all positive real numbers $x$ and $y$.
In an isosceles right-angled triangle shaped billiards table , a ball starts moving from one of the vertices adjacent to hypotenuse. When it reaches to one side then it will reflect its path. Prove that if we reach to a vertex then it is not the vertex at initial position
[i]By Sam Nariman[/i]
Consider the set
\[A = \left\{1+\frac{1}{k} : k=1,2,3,4,\cdots \right\}.\]
[list=a]
[*]Prove that every integer $x \geq 2$ can be written as the product of one or more elements of $A$, which are not necessarily different.
[*]For every integer $x \geq 2$ let $f(x)$ denote the minimum integer such that $x$ can be written as the
product of $f(x)$ elements of $A$, which are not necessarily different.
Prove that there exist infinitely many pairs $(x,y)$ of integers with $x\geq 2$, $y \geq 2$, and \[f(xy)<f(x)+f(y).\] (Pairs $(x_1,y_1)$ and $(x_2,y_2)$ are different if $x_1 \neq x_2$ or $y_1 \neq y_2$).
[/list]
We color one of the numbers $1,...,8$ with white or black according to the following rules:
i) number $4$ gets colored white and one at lest of the following numbers gets colored black
ii) if two numbers $a,b$ are colored in a different color and $a+b\le 8$, then number $a+b$ gets colored black.
iii) if two numbers $a,b$ are colored in a different color and $a\cdot b\le 8$, then number $a\cdot b$ gets colored white.
If by those rules, all numbers get colored, find the color of each number.
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]
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 $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.
Turbo the snail sits on a point on a circle with circumference $1$. Given an infinite sequence of positive real numbers $c_1, c_2, c_3, \dots$, Turbo successively crawls distances $c_1, c_2, c_3, \dots$ around the circle, each time choosing to crawl either clockwise or counterclockwise.
Determine the largest constant $C > 0$ with the following property: for every sequence of positive real numbers $c_1, c_2, c_3, \dots$ with $c_i < C$ for all $i$, Turbo can (after studying the sequence) ensure that there is some point on the circle that it will never visit or crawl across.
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.