Found problems: 5802
Prove that for any integer $n$, there exists a unique polynomial $Q$ with coefficients in $\{0,1,\ldots,9\}$ such that $Q(-2) = Q(-5) = n$.
Show that $ x^3 + x+ a^2 = y^2 $ has at least one pair of positive integer solution $ (x,y) $ for each positive integer $ a $.
Let $a_1, \dots, a_n, b_1, \dots, b_n$ be $2n$ positive integers such that the $n+1$ products
\[a_1 a_2 a_3 \cdots a_n, b_1 a_2 a_3 \cdots a_n, b_1 b_2 a_3 \cdots a_n, \dots, b_1 b_2 b_3 \cdots b_n\]
form a strictly increasing arithmetic progression in that order. Determine the smallest possible integer that could be the common difference of such an arithmetic progression.
Two players in turns color the sides of an $n$-gon. The first player colors any side that has $0$ or $2$ common vertices with already colored sides. The second player colors any side that has exactly $1$ common vertex with already colored sides. The player who cannot move, loses. For which $n$ the second player has a winning strategy?
Let $n\geq 2$ and $A,B\in\mathcal{M}_n(\mathbb{C})$ such that $$\{\text{rank}(A^k)\mid k\geq 1\}=\{\text{rank}(B^k)\mid k\geq 1\}.$$ Prove that $\text{rank}(A^k)=\text{rank}(B^k)$ for all $k\geq 1$.
[i]Cristi Săvescu[/i]
Prove that every convex polygon has at most one triangulation consisting entirely of acute triangles.
The Fibonacci sequence is defined by \[ a_{n+1} = a_n + a_{n-1}, n \geq 1, a_0 = 0, a_1 = a_2 = 1. \] Find the greatest common divisor of the 1960-th and 1988-th terms of the Fibonacci sequence.
Let $P$ be a regular $2006$-gon. A diagonal is called [i]good[/i] if its endpoints divide the boundary of $P$ into two parts, each composed of an odd number of sides of $P$. The sides of $P$ are also called [i]good[/i].
Suppose $P$ has been dissected into triangles by $2003$ diagonals, no two of which have a common point in the interior of $P$. Find the maximum number of isosceles triangles having two good sides that could appear in such a configuration.
Find all such functions $f :\mathbb{R}\to \mathbb{R}$ such that for all $x,y\in\mathbb{R}$ the following holds :
\[ f(x^2)+f(xy)=f(x)f(y)+yf(x)+xf(x+y) \]
A round robin tournament is held with $2016$ participants. Each player plays each other player once and no games result in ties. We say a pair of players $A$ and $B$ is a [i]dominant pair[/i] if all other players either defeat $A$ and $B$ or are defeated by both $A$ and $B$. Find the maximum number dominant pairs.
[i]Proposed by Nathan Ramesh
There is a chessboard with $m$ columns and $n$ rows. In each blanks, an integer is given. If a rectangle $R$ (in this chessboard) has an integer $h$ satisfying the following two conditions, we call $R$ as a 'shelf'.
(i) All integers contained in $R$ are bigger than $h$.
(ii) All integers in blanks, which are not contained in $R$ but meet with $R$ at a vertex or a side, are not bigger than $h$.
Assume that all integers are given to make shelves as much as possible. Find the number of shelves.
Let $\mathbb{N} =\{1, 2, 3, ...\}$ be the set of positive integers. Let $f : \mathbb{N} \rightarrow \mathbb{N}$ be a function that gives a positive integer value, to every positive integer. Suppose that $f$ satisfies the following conditions:
$f(1)=1$
$f(a+b+ab)=a+b+f(ab)$
Find the value of $f(2015)$
Proposed by Jose Antonio Gomez Ortega
Let $\langle a_n\rangle_{n\ge 0}$ be a sequence of integers satisfying $a_0=1, a_1=3$ and $a_{n+2}=1+\left\lfloor \frac{a_{n+1}^2}{a_n}\right\rfloor \ \ \forall n\ge0.$
Prove that
$a_n\cdot a_{n+2}-a_{n+1}^2=2^n$ for every natural number $n.$
Find all integers $n \geq 3$ such that among any $n$ positive real numbers $a_1, a_2, \hdots, a_n$ with $\text{max}(a_1,a_2,\hdots,a_n) \leq n \cdot \text{min}(a_1,a_2,\hdots,a_n)$, there exist three that are the side lengths of an acute triangle.
Define sequence $ (a_n)$ by $ \sum_{d|n} a_d \equal{} 2^n.$ Show that $ n|a_n.$
Let $x_n$ be the $n$-th non-square positive integer. Thus $x_1=2, x_2=3, x_3=5, x_4=6,$ etc. For a positive real number $x$, denotes the integer closest to it by $\langle x\rangle$. If $x=m+0.5$, where $m$ is an integer, then define $\langle x\rangle=m$. For example, $\langle 1.2\rangle =1, \langle 2.8 \rangle =3, \langle 3.5\rangle =3$. Show that $x_n=n+\langle \sqrt{n}\rangle$
The Bank of Bath issues coins with an $H$ on one side and a $T$ on the other. Harry has $n$ of these coins arranged in a line from left to right. He repeatedly performs the following operation: if there are exactly $k>0$ coins showing $H$, then he turns over the $k$th coin from the left; otherwise, all coins show $T$ and he stops. For example, if $n=3$ the process starting with the configuration $THT$ would be $THT \to HHT \to HTT \to TTT$, which stops after three operations.
(a) Show that, for each initial configuration, Harry stops after a finite number of operations.
(b) For each initial configuration $C$, let $L(C)$ be the number of operations before Harry stops. For example, $L(THT) = 3$ and $L(TTT) = 0$. Determine the average value of $L(C)$ over all $2^n$ possible initial configurations $C$.
[i]Proposed by David Altizio, USA[/i]
Let $n$ be a positive integer. At most how many distinct unit vectors can be selected in $\mathbb{R}^n$ such that from any three of them, at least two are orthogonal?
Let $V_n=\sqrt{F_n^2+F_{n+2}^2}$, where $F_n$ is the Fibonacci sequence
($F_1=F_2=1,F_{n+2}=F_{n+1}+F_{n}$)
Show that $V_n,V_{n+1},V_{n+2}$ are the sides of a triangle with area $1/2$
Prove that for any odd prime number $ p,$ the number of positive integer $ n$ satisfying $ p|n! \plus{} 1$ is less than or equal to $ cp^\frac{2}{3}.$ where $ c$ is a constant independent of $ p.$
Let $r\geq2$ be a fixed positive integer, and let $F$ be an infinite family of sets, each of size $r$, no two of which are disjoint. Prove that there exists a set of size $r-1$ that meets each set in $F$.
Let $\mathbb Q_{>0}$ be the set of all positive rational numbers. Let $f:\mathbb Q_{>0}\to\mathbb R$ be a function satisfying the following three conditions:
(i) for all $x,y\in\mathbb Q_{>0}$, we have $f(x)f(y)\geq f(xy)$;
(ii) for all $x,y\in\mathbb Q_{>0}$, we have $f(x+y)\geq f(x)+f(y)$;
(iii) there exists a rational number $a>1$ such that $f(a)=a$.
Prove that $f(x)=x$ for all $x\in\mathbb Q_{>0}$.
[i]Proposed by Bulgaria[/i]
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$.
If $p=2^{16}+1$ is a prime, find the maximum possible number of elements in a set $S$ of positive integers less than $p$ so no two distinct $a,b$ in $S$ satisfy $$a^2\equiv b\pmod{p}.$$
Find all functions $f: \mathbb{N}\to \mathbb{N}$ such that for all $n\in \mathbb{N}$: \[f^{(19)}(n)+97f(n)=98n+232.\]